5850
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
- 36
- Divisor Sum
- 16926
- Proper Divisor Sum (Aliquot Sum)
- 11076
- 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
- 1440
- Möbius Function
- 0
- Radical
- 390
- Omega Function (Ω)
- 6
- 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
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 142
- 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
- Generalized sum of divisors function.at n=49A002132
- Theta series of D_5 lattice.at n=32A005930
- a(n) = binomial(n+3, 3)/4 for odd n, n*(n+2)*(n+4)/24 for even n.at n=50A006918
- a(n) = 2*binomial(n,3).at n=27A007290
- a(n) = n OR n^3 (applied to binary expansions).at n=17A008468
- a(n) = n OR n^3 (applied to ternary expansions).at n=17A008469
- Expansion of 1/((1-3x)(1-10x)(1-11x)).at n=3A018206
- a(n) = n*(9*n + 1)/2.at n=36A022267
- a(n) = sum of the numbers between the two n's in A026370.at n=39A026373
- a(n) = n^3 + n.at n=18A034262
- Parker's partition triangle T(n,k) read by rows (n >= 1 and 0 <= k <= n-1).at n=62A047812
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 6 skipped primes.at n=34A050773
- Truncated triangular pyramid numbers: a(n) = Sum_{k=9..n} (k*(k+1)/2 - 45).at n=25A051943
- Numbers k such that k^6 == 1 (mod 7^4).at n=14A056092
- Numbers k such that sigma(x) = k has exactly 6 solutions.at n=22A060662
- a(n) = 18*(n - 2)*(2*n - 5).at n=13A060787
- Numbers n such that n and its reversal are both multiples of 13.at n=28A062903
- Non-palindromic number and its reversal are both multiples of 13.at n=16A062912
- Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,3.at n=26A064238
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,47.at n=3A064260