10251
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
- 12
- Divisor Sum
- 15912
- Proper Divisor Sum (Aliquot Sum)
- 5661
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6336
- Möbius Function
- 0
- Radical
- 3417
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 148
- 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
- no
- Odd
- yes
Appears in sequences
- Number of strict first-order maximal independent sets in path graph.at n=32A007383
- a(n) = floor(n*(n+2)*(2*n-1)/8).at n=33A007518
- Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(3,6).at n=14A018918
- Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits.at n=15A020342
- Pisot sequences E(6,8), P(6,8).at n=26A020716
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-4).at n=32A023434
- Odd 10-gonal (or decagonal) numbers.at n=25A028993
- n satisfying sigma(n+1) = sigma(n-1).at n=19A055574
- Numbers m that minimize | k / EulerPhi(k) - golden ratio phi | when k runs over all the numbers with the same number of digits as m.at n=7A065657
- Numbers k such that sigma(k-1) divides sigma(k+1).at n=23A067130
- Expansion of 1/((1-2*x+x^2-x^3)*(1-x)).at n=15A077855
- Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; a(n) is the number of distinct partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p<=A000230(n). Multiple occurrences of a partition are not counted.at n=44A079024
- a(n) = 6*n^2 + 4*n + 1.at n=41A080859
- Cardinality of set of sets of parts of all partitions of n.at n=43A088314
- Beginning with 2, least number such that concatenation of r copies of a(r), r = 1 to n is prime.at n=46A090559
- a(n) = floor(11^n/8^n).at n=29A094995
- 3-Smith numbers.at n=29A104391
- 10-gonal numbers which are divisible by the sum of their digits.at n=19A119548
- A106486-encodings of combinatorial games equivalent to game {0|0}.at n=25A125994
- a(n) = floor(sqrt(pi(2^n))).at n=31A133498