1596
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 4480
- Proper Divisor Sum (Aliquot Sum)
- 2884
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 432
- Möbius Function
- 0
- Radical
- 798
- 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
- yes
- 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
- 122
- 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) = Fibonacci(n) - 1.at n=16A000071
- Smallest number such that n-th iterate of Chowla function is 0.at n=16A002954
- a(1) = 1; for n>1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=48A003508
- Möbius transform of A003965.at n=46A003980
- a(n) = floor(n*phi^9), where phi is the golden ratio, A001622.at n=21A004924
- a(n) = round(n*phi^9), where phi is the golden ratio, A001622.at n=21A004944
- Denominators of Cauchy numbers of first type.at n=18A006233
- Numbers n such that n^32 + 1 is prime.at n=29A006315
- Moebius transform of Fibonacci numbers.at n=16A007436
- Coordination sequence T5 for Zeolite Code GOO.at n=27A008115
- Coordination sequence T3 for Zeolite Code SGT.at n=25A008231
- a(n) = Fibonacci(n) + (-1)^n.at n=17A008346
- Coordination sequence for {A_6}* lattice.at n=4A008534
- "Pascal sweep" for k=8: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=21A009522
- Expansion of e.g.f. sinh(log(1+x)*exp(x)).at n=8A009581
- Coordination sequence T1 for Zeolite Code -PAR.at n=28A009855
- Coordination sequence T3 for Zeolite Code -ROG.at n=30A009861
- Coordination sequence T1 for Zeolite Code AHT.at n=27A009866
- Coefficients in expansion of Pi as Sum_{n>=1} a(n)/(n*n!*(n+1)!), as found by greedy algorithm.at n=52A011191
- a(n) = floor( n*(n-1)*(n-2)/5 ).at n=21A011887