10170
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 26676
- Proper Divisor Sum (Aliquot Sum)
- 16506
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2688
- Möbius Function
- 0
- Radical
- 3390
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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
- Number of Twopins positions.at n=20A005687
- T(n,1) + T(n,2) + ... T(n,n), where T is the array in A026098.at n=24A026101
- A hierarchical sequence (S(W2{2}c) - see A059126).at n=9A059133
- Numbers of the form (10*a + b)^2 + (10*b + a)^2 with a and b less than 10, in numerical order.at n=42A061191
- Numbers k such that prime(k) == -1 (mod sigma(k)).at n=16A067696
- Self-convolution of A073711.at n=39A073712
- a(n) = 3*n^3 + 3*n.at n=15A119536
- Let f(n) = A004001(n)^2 - A005185(n)^2. Then a(n) = f(abs(f(n-1))) + f(abs(n - f(n-1))).at n=47A121459
- Largest terms a(n) forming a self-convolution of an integer sequence (A132834) such that: a(n) <= 3*a(n-1) for n>0 with a(0)=1.at n=9A132833
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=9.at n=19A135194
- Numbers n such that d(n + d(n)) = d(n), where d(n) is the sum of the distinct primes dividing n.at n=15A175760
- a(n) = n*(5*n+1).at n=45A202803
- Numbers with exactly 12 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=19A213319
- Numbers m such that m divides Sum_{k=1..m} lambda(k).at n=10A227975
- Arises from counting tensor invariants without color.at n=2A232214
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 774", based on the 5-celled von Neumann neighborhood.at n=37A273504
- Numbers m such that there are precisely 20 groups of order m.at n=34A298911
- Partial sums of A299259.at n=22A299265
- Largest number k such that exactly half the numbers in [1..k] are prime(n)-smooth.at n=42A308904
- Lexicographically first sequence starting with a(1) = 1, with no duplicate term, such that a(n) is the result of a self-additive linear combination of its own digits (concatenated sometimes into substrings).at n=38A323823