5405
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6912
- Proper Divisor Sum (Aliquot Sum)
- 1507
- 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
- 4048
- Möbius Function
- -1
- Radical
- 5405
- Omega Function (Ω)
- 3
- 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
- 160
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Ruth-Aaron numbers (1): sum of prime divisors of n = sum of prime divisors of n+1.at n=14A006145
- a(n) = floor(binomial(n,3)/3).at n=47A011849
- Powers of fifth root of 4 rounded to nearest integer.at n=31A018124
- Powers of fifth root of 4 rounded up.at n=31A018125
- Pseudoprimes to base 93.at n=39A020221
- Expansion of 1/((1-2x)(1-6x)(1-8x)(1-9x)).at n=3A026561
- 5 times triangular numbers: a(n) = 5*n*(n+1)/2.at n=46A028895
- Denominator of Bernoulli(2n+2) - Bernoulli(2n).at n=22A029763
- Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity).at n=14A039752
- Numbers common to A006145 and A039752.at n=3A039753
- Surround numbers of a length 2n zig-zag.at n=19A060641
- Numbers k such that sopfr(k) = sopf(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=9A064675
- Numbers k such that sopf(k) = sopfr(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=13A064678
- Numbers k such that gcd(3k,8^k+1) = 3 but k does not divide the numerator of B(2k) (the Bernoulli numbers).at n=8A070193
- One eighty-fourth the area of primitive Pythagorean triangles with (increasing) square hypotenuses (precisely those of A008846).at n=5A072289
- Total number of square parts in all partitions of n.at n=23A073336
- Binomial transform of A073817: a(n)=Sum(Binomial(n,k)*A073817(k),(k=0,..,n)).at n=8A075116
- Number of different prime signatures of the m values when A056239(m) is equal to n.at n=52A088887
- Cupolar numbers: a(n) = (n+1)*(5*n^2 + 7*n + 3)/3.at n=14A096000
- a(n) = (n+1)*prime(n) + n*prime(n+1).at n=25A097240