10330
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18612
- Proper Divisor Sum (Aliquot Sum)
- 8282
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4128
- Möbius Function
- -1
- Radical
- 10330
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 33.at n=29A020372
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=30A024480
- Global ranks of terms of A057122: tells which terms of A014486 form rooted plane binary trees also when interpreted as codes for ordinary rooted planar trees.at n=29A057123
- Numbers n such that n concatenated with n+1 is triangular.at n=16A094609
- Sum of largest parts (counted with multiplicity) in all compositions of n.at n=11A097976
- Connell (5,3)-sum sequence (partial sums of the (5,3)-Connell sequence).at n=67A122795
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=8A149291
- Euler transform of A051064, the ruler function sequence for k=3.at n=27A173241
- Number of 10's in the last section of the set of partitions of n.at n=51A206560
- Number of arrays of 4 0..n integers with no sum of consecutive elements equal to a disjoint adjacent sum of an equal number of elements.at n=9A215191
- Partial sums of 3-almost primes which are again 3-almost primes, i.e., have exactly 3 not necessarily distinct prime factors.at n=17A217018
- Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 3 array.at n=21A219699
- Number of Gram blocks [g(j), g(j+1)) up to 10^n, 0 <= j < 10^n, which do not contain any zeros of Z(t), where Z(t) is the Riemann-Siegel Z-function.at n=3A231162
- G.f.: 1/(1-(2*x^2+x^3)*(1-sqrt(1-4*x))).at n=11A234276
- Expansion of F(x^2, x) where F(x,y) is the g.f. of A239927.at n=70A239928
- Numbers k such that 10^k - 2001 is prime.at n=11A278471
- a(n) is the smallest number k such that 2k - sigma(k) = 2^n.at n=10A292557
- a(n) is the lowest number in the sequence of the first occurrence of exactly n consecutive numbers with at least one repeated digit, or -1 if no such number exists.at n=11A337707
- a(n) = Sum_{k=1..floor(n/2)} k * (n-k) * floor((n-k)/k).at n=34A339804
- Triprimes a such that, if b is the next triprime, a + b and b - a are also triprimes.at n=44A365833