9027
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
- 14040
- Proper Divisor Sum (Aliquot Sum)
- 5013
- 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
- 5568
- Möbius Function
- 0
- Radical
- 3009
- 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
- 184
- 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
- a(0) = 1, a(n) = 25*n^2 + 2 for n > 0.at n=19A010015
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 95.at n=0A031593
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 95.at n=0A031773
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 5).at n=59A035572
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 8 skipped primes.at n=44A050775
- Self-convolution of 1,4,27,256,3125,46656,... (cf. A000312).at n=4A053729
- Numbers k such that k | 12^k + 11^k + 1.at n=28A057293
- Row sums in A083175.at n=16A083175
- The two digits touching the first comma have as absolute difference 0. The next such difference is 1. The next one is 2. Then 3, 4, 5... etc. When we reach 9 the differences start a new cycle: 0, 1, 2, 3... etc. Among many such possible sequences, this is the slowest increasing one starting with "1".at n=42A098795
- Least sum (n+1) + (n+2) + ... + (n+k) that is a multiple of the n-th triangular number, n(n+1)/2.at n=16A110351
- Start with 1 and repeatedly reverse the digits and add 61 to get the next term.at n=41A118156
- Number of sets of points determined by the intersection of a line with an n X n grid of points.at n=14A119438
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+937)^2 = y^2.at n=5A129974
- Integers k such that 10^k + 63 is a prime number.at n=18A135115
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 3X2 zee 1,1 1,2 1,3 2,3 2,4 in any orientation.at n=13A146131
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1000-1100-0111-0100 pattern in any orientation.at n=11A147156
- a(n) = 4*n*(n+1) + 3.at n=47A164897
- Multiples of 17 whose reversal - 1 is also a multiple of 17.at n=33A166398
- a(n) = prime(n)*T(n), where T = A000217.at n=16A196421
- Fibonacci sequence beginning 11, 8.at n=15A206420