9488
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 18414
- Proper Divisor Sum (Aliquot Sum)
- 8926
- 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
- 4736
- Möbius Function
- 0
- Radical
- 1186
- Omega Function (Ω)
- 5
- 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
- 78
- 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
- a(n) = floor(Pi^n).at n=8A001672
- Ordered sequence of distinct terms of the form floor(Pi^i * floor(Pi^j)), i, j >= 0.at n=29A022767
- a(n) = Sum_{i=0..floor(n/2)} A047080(n,i).at n=16A047082
- a(n) = Sum_{i=0..floor((n+1)/2)} A047080(n,i).at n=16A047083
- Number of solutions to c(1)t(1) + ... + c(n)t(n) = 0, where c(i) = +-1 for i>1, c(1) = t(1) = 1, t(i) = triangular numbers (A000217).at n=23A058498
- a(n)/n^2 is the minimal average squared Euclidean distance of n points to their center of gravity among all configurations of n points on the hexagonal lattice.at n=40A059518
- Scaled triangle A067327.at n=23A067328
- Numbers n such that log_pi(n) is closer to an integer than is log_pi(m) for any m with 2<=m<n.at n=5A080022
- Numbers k such that k!!!!!! + 1 is prime.at n=39A085150
- Numbers n not of the form i^2+(i+1)^2 such that there are integers a < b with a^2+(a+1)^2+...+(n-1)^2 = n^2+(n+1)^2+...+b^2.at n=19A094523
- a(n) = Min{x : A073124(x) = 2n}.at n=36A096480
- a(n) = floor(Pi^(n/2)).at n=16A102475
- Numbers k such that (2*k)!/(2*(k!)^2) - 1 is prime.at n=20A112861
- Last entry (and high point) in segment n of A079051.at n=36A117516
- Merged values of A014217 = {floor(((1+sqrt(5))/2)^n)}, A000149 = {floor(e^n)}, and A001672 = {floor(Pi^n)}, with multiplicity.at n=38A119604
- Number of 2-anisohedral polyhexes of order n.at n=15A120117
- Square matrix read by antidiagonals: T(m,n) = m-th term in the continued fraction expansion of Pi^n.at n=28A137299
- Number of permutations of floor(i*6/5), i=0..n-1, with all sums of two adjacent terms unique.at n=7A147919
- a(n) = n*(2*n^2 + 5*n + 1).at n=16A163832
- Monotonic ordering of nonnegative differences 10^i-2^j, for 40>= i>=0, j>=0.at n=26A192125