5457
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7776
- Proper Divisor Sum (Aliquot Sum)
- 2319
- 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
- 3392
- Möbius Function
- -1
- Radical
- 5457
- 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
- 67
- 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
- a(n) = ceiling(n*phi^15), where phi is the golden ratio, A001622.at n=4A004970
- a(n) = prime(n)*(prime(n-1)-1)/2.at n=25A014302
- Numbers whose sum of divisors is a fifth power.at n=14A019423
- Numbers whose set of base-11 digits is {1,4}.at n=22A032823
- a(n) = n*(2*n+5).at n=51A033537
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 4 (mod 5).at n=54A035584
- Base-8 palindromes that start with 1.at n=39A043021
- a(1) = 4; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=40A046254
- a(1) = 6; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=33A046256
- Integers whose sum of divisors is 6^5 = 7776.at n=9A048255
- a(n) = n*(n^2 - 6*n + 11)/6.at n=34A050407
- a(n) = T(n,n-4), array T as in A055818.at n=14A055821
- Coefficients in expansion of Sum_{n >= 1} x^n/(1-x^n)^4.at n=31A059358
- a(n) = (11*n^2 - 11*n + 2)/2.at n=31A069125
- Sum of numbers in n-th upward diagonal of triangle in A079823.at n=32A079824
- Expansion of (1+2x)^2/((1-x^2)(1-2x)).at n=10A085278
- square resultant of a complex prime genus function based on modulo 12 genus and modulo six genus functions.at n=48A116580
- Minimum over all permutations b of 1..n of sum b(i)*b^{-1}(i).at n=30A118375
- Number of distinct values taken by the entropy for permutations of [1..n], where the entropy of a permutation pi is Sum_{k=1..n} (pi(k)-k)^2.at n=32A126972
- Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^3 = 1 + A098999(k).at n=16A128167