4875
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 8736
- Proper Divisor Sum (Aliquot Sum)
- 3861
- 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
- 2400
- Möbius Function
- 0
- Radical
- 195
- Omega Function (Ω)
- 5
- 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
- 121
- 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
- Coordination sequence T5 for Zeolite Code MTT.at n=43A008193
- Crystal ball sequence for planar net 3.6.3.6.at n=46A008580
- Numbers having three 6's in base 9.at n=13A043479
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048212.at n=18A048222
- a(n) = Sum{a(k): k=0,1,2,...,n-3,n-1}; a(n-2) is not a summand; 2 initial terms required.at n=15A049855
- Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n-1} k^2.at n=13A050410
- Numbers k such that 165*2^k-1 is prime.at n=44A050834
- Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n + 5^n.at n=46A057259
- a(n) = (1/6)*(2*n - 3)*(n + 2)*(n + 1).at n=26A058373
- Numbers k such that 7*2^k - 3 is prime.at n=27A058593
- Odd numbers k such that the palindromic wing number (a.k.a. near-repdigit palindrome) 7*(10^k - 1)/9 - 2*10^((k-1)/2) is prime.at n=8A077785
- Average of row n of A082259.at n=23A082262
- Numbers n that are the hypotenuse of exactly 10 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 10 ways.at n=6A097225
- Numbers that have exactly five prime factors counted with multiplicity (A014614) whose digit reversal is different and also has 5 prime factors (with multiplicity).at n=37A109025
- Minimum number of moves to solve the first Panex puzzle of order n of transferring a side tower to the center column.at n=9A109175
- Number of connected simple graphs with n vertices, n+2 edges, and vertex degrees no more than 4.at n=9A112619
- Triangle whose k-th column has e.g.f. exp(x)*sum{j=0..k, (-1)^j*Bessel_I(k+j,2x)}.at n=57A116407
- E.g.f. exp(x)*(Bessel_I(2,2*x) - Bessel_I(3,2*x) + Bessel_I(4,2*x)).at n=10A116408
- Numbers n such that A086793(n)=20.at n=38A119396
- a(n) = n * A062949(n).at n=38A127469