10952
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21105
- Proper Divisor Sum (Aliquot Sum)
- 10153
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5328
- Möbius Function
- 0
- Radical
- 74
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 42
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- If a, b in sequence, so is ab+8.at n=42A009331
- Coordination sequence for lattice D*_74 (with edges defined by l_1 norm = 1).at n=2A035822
- Coordination sequence for diamond structure D^+_74. (Edges defined by l_1 norm = 1.)at n=2A035913
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=13A049972
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(2) = 4.at n=30A050039
- Even numbers n such that 37^2 (the square of the first irregular prime) divides the numerator of Bernoulli(n).at n=20A090789
- Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 37, the first irregular prime.at n=40A092230
- G.f. A(x) satisfies: A(x) = x*f(A(x),A(x)^2/x) where f(,) is Ramanujan's theta function; i.e., A(x) = x*Sum_{n=-oo,+oo} A(x)^(n*(n+1)/2) * (A(x)^2/x)^(n*(n-1)/2).at n=7A107945
- Numbers that factorize into a prime number of distinct prime factors each raised to a different prime exponent.at n=41A114128
- Powerful(1) numbers (A001694) which are the sum of distinct double factorials (A006882).at n=41A115651
- Powerful(1) numbers (A001694) whose digit reversal is a semiprime (A001358).at n=42A115687
- Row sums of triangle A125806.at n=10A125809
- a(n) = 8*n^2.at n=37A139098
- Numbers of the form p^2 * q^3, where p,q are distinct primes.at n=25A143610
- a(n) = a(n-2) + 2^(n-1) + 5 for n>3, a(0..3) = (0,1,2,7).at n=14A147672
- 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, 1), (-1, 0, 0), (-1, 0, 1), (-1, 1, -1), (1, 0, 0)}.at n=10A148508
- First differences of A160379.at n=19A163989
- Number of nontrivial compositions of differential operations and directional derivative of the n-th order on the space R^10.at n=20A187179
- Augmentation of the triangle A011973. See Comments.at n=26A193607
- Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,3,2,4,0 for x=0,1,2,3,4.at n=12A196917