8901
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13728
- Proper Divisor Sum (Aliquot Sum)
- 4827
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5544
- Möbius Function
- 0
- Radical
- 2967
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 140
- Smith Number
- yes
- 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
- Nearest integer to n^(5/2).at n=38A036488
- Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) + 17 for n > 0.at n=7A056262
- Numbers in which each digit is the (immediate) successor of the previous one (if it exists) and 0 is considered the successor of 9.at n=35A059043
- Smallest number that has digits in order ...123...901... and is divisible by n. If no such number exists then a(n) = 0.at n=42A061805
- Starting at the chess position shown, a(n) is the number of ways Black can make n consecutive moves, followed by a checkmate in one move by White.at n=18A078993
- a(n) = ceiling(((1*n^0 + 1*n^1 + 2*n^2 + 4*n^3)/(1*n^0 + 2*n^1 + 1*n^2))^2).at n=24A085505
- Short leg of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=38A089547
- Number of one-element transitions from the partitions of n to the partitions of n+1 for labeled parts.at n=22A093694
- Smallest available integer which fits into the repeating pattern 0123456789.at n=24A098755
- Numerators of n-th approximants of a continued fraction for Pi-3.at n=5A142970
- Integer part of square root of n^5 = A000584(n).at n=37A155013
- Composites with consecutive (ascending) digits.at n=25A161760
- a(n) = n-th odd nonprime * n-th odd number.at n=34A163506
- Append three digits, each increasing by one modulo 10 from the last digit of the nonnegative integers. 0 -> 123, 1 -> 1234 2 -> 2345, ... , 9 -> 9012, 10 -> 10123, etc.at n=8A167231
- Indices of pentagonal numbers which are also decagonal.at n=2A202564
- a(n) = Sum_{i=0..n} digsum_6(i)^3, where digsum_6(i) = A053827(i).at n=48A231674
- Number of (n+1) X (1+1) 0..2 arrays with the maximum plus the upper median minus the lower median minus the minimum of every 2 X 2 subblock equal.at n=4A236886
- Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the upper median minus the lower median minus the minimum of every 2X2 subblock equal.at n=0A236890
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median minus the lower median minus the minimum of every 2X2 subblock equal.at n=10A236893
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median minus the lower median minus the minimum of every 2X2 subblock equal.at n=14A236893