10172
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 17808
- Proper Divisor Sum (Aliquot Sum)
- 7636
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5084
- Möbius Function
- 0
- Radical
- 5086
- Omega Function (Ω)
- 3
- 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
- 179
- 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
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Numbers n such that n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 is palindromic.at n=1A027576
- Susceptibility series H_2 for 2-dimensional Ising model (divided by 2).at n=43A054275
- Number of 3-element proper antichains (i.e., antichains such that every two members have nonempty intersection) on an unlabeled n-element set.at n=14A056782
- Starting term of the smallest n-chain of numbers whose squares are permutations of the same digits.at n=12A085546
- Assume the conjectured terms of A105594 are the correct beginnings of the trajectories described in A003508. a(n) is a record length of b(n) iterations to arrive at the collected trajectories. This sequence cites the a(n)'s.at n=16A105600
- Numbers k such that k and k^2 together contain all ten digits.at n=28A122477
- Numbers with exactly 11 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=17A213318
- A bisection of A183168.at n=37A215933
- Number of 5 X 5 0..n matrices with each 2 X 2 subblock idempotent.at n=43A224667
- Number of (n+1) X (6+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=9A235287
- Number of partitions of n where the difference between consecutive parts is at most 3.at n=39A238863
- Number of odd partitions in the multiset of intersections of the set of partitions of n with itself three times; also number of distinct partitions in that multiset.at n=8A274733
- Number of cyclic subgroups of the group SL(2, Z(n)), counting conjugates as distinct.at n=40A316537
- Indices n of Gram points g(n) for successive positive maxima of the Riemann zeta function on critical line.at n=30A327543