5049
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
- 16
- Divisor Sum
- 8640
- Proper Divisor Sum (Aliquot Sum)
- 3591
- 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
- 2880
- Möbius Function
- 0
- Radical
- 561
- 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
- 85
- 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
- Octagonal pyramidal numbers: a(n) = n*(n+1)*(2*n-1)/2.at n=16A002414
- Kaprekar triples: q such that q = x + y + z and q^3 = x*10^2n + y*10^n + z, where z < 10^n and n is the number of digits in q. q is not a power of 10 (except q=1).at n=9A006887
- Odd integers m such that phi(m) | sigma(m).at n=10A015715
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite LTN = Linde Type N Na384[Al384Si384O1536].518H2O starting with a T4 atom.at n=5A019039
- Numbers k such that d(k) (number of divisors) divides phi(k) (Euler function) divides sigma(k) (sum of divisors).at n=46A020493
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=39A023180
- a(n) = Sum_{k=1..n} k*[ (n/k)*[ (n/k)*[ n/k ] ] ].at n=14A024933
- 9 times the triangular numbers A000217.at n=33A027468
- a(n) = (2*n+1) * (4*n-1).at n=25A033566
- Base-7 palindromes that start with 2.at n=21A043016
- Terms of Binary Gleichniszahlen-Reihe (BGR) sequence A045998 converted into decimal (Look and Say Sequence, mod 2, read in binary and converted to decimal).at n=16A048522
- a(n)=T(n,2), array T as in A049735.at n=40A049745
- Image of partition numbers (A000041) under "little Hankel" transform that sends [c_0, c_1, ...] to [d_0, d_1, ...] where d_n = c_n^2 - c_{n+1}*c_{n-1}.at n=19A056222
- Numbers n such that n | 3^n + 2^n + 1^n.at n=18A056645
- Smallest palindrome greater than n in bases 2 and n.at n=47A056749
- Numbers n such that n | 6^n + 4^n + 2^n.at n=47A057844
- Pseudo-Kaprekar triples: q such that if q=x+y+z, then q^3=x*10^i + y*10^j + z, where (y*10^j+z < 10^i) and z < 10^j.at n=19A060768
- Erroneous version of A006887.at n=10A060809
- Composite n such that sigma(n)-phi(n) divides sigma(n)+phi(n).at n=39A061367
- Integer part of log(n!)^(1 + log(1 + log(1 + n))).at n=18A062445