2477
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2478
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 2476
- Möbius Function
- -1
- Radical
- 2477
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 367
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of partitions into non-integral powers.at n=14A000158
- a(0)=2; for n>=1, a(n) = smallest prime p such that there is a gap of exactly 2n between p and next prime, or -1 if no such prime exists.at n=13A000230
- Let p = n-th odd prime. Then a(n) = least prime congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p.at n=5A001992
- Coordination sequence T9 for Zeolite Code EUO.at n=31A008104
- Coordination sequence T1 for Zeolite Code KFI.at n=38A008123
- If x and y are terms, so is x*y + 9.at n=20A009350
- Expansion of tan(x)*cosh(tan(x)).at n=3A009733
- Expansion of e.g.f. tan(x)*exp(tan(x)).at n=7A009737
- Expansion of e.g.f. tan(x)/cos(sinh(x)), odd powers only.at n=3A009756
- a(0) = 1, a(n) = 11*n^2 + 2 for n>0.at n=15A010003
- Numbers k such that the continued fraction for sqrt(k) has period 13.at n=15A020352
- Place where n-th 1 occurs in A023123.at n=42A022785
- Primes that remain prime through 3 iterations of function f(x) = 5x + 6.at n=16A023285
- Primes that remain prime through 4 iterations of function f(x) = 5*x + 6.at n=3A023315
- Self-convolution of (1, p(1), p(2), ...).at n=14A023626
- Golc sequence in base 2. Left to right concatenation of n,int(log_2(n)),int(log_2(int(log_2(n)))),... in base 2.at n=37A028432
- Lower prime of a record difference between it and the second prime after it.at n=11A031133
- a(n) = prime(9*n - 2).at n=40A031383
- a(n) = prime(10*n-3).at n=36A031391
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 5.at n=16A031418