5430
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 13104
- Proper Divisor Sum (Aliquot Sum)
- 7674
- 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
- 1
- Radical
- 5430
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 98
- 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
- yes
- Odd
- no
Appears in sequences
- Generalized sum of divisors function.at n=51A002130
- Oscillates under partition transform.at n=41A007211
- Coordination sequence T3 for Zeolite Code SGT.at n=46A008231
- n written in fractional base 6/5.at n=18A024638
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+7 or 24k-7. Also number of partitions in which no odd part is repeated, with at most 3 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=43A036032
- Numbers with exactly 4 distinct palindromic prime factors.at n=9A046402
- Second pentagonal numbers with even index: a(n) = n*(6*n+1).at n=30A049453
- Number of nonprimes <= prime(n)^2.at n=21A053683
- Numbers k such that k^12 == 1 (mod 13^3).at n=28A056086
- Numbers k such that k and its reversal are both multiples of 15.at n=35A062905
- Non-palindromic number and its reversal are both multiples of 15.at n=30A062914
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,9.at n=9A064241
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,17.at n=3A064245
- Values of m such that N = (m+1)(2m+1)(71m+1) is a 3-Carmichael number (A087788).at n=1A065703
- Integers k such that k*28*c + 1 is prime for c = 1, 2, 4, 7 and 14.at n=4A067199
- a(n) = 60*n^2 + 180*n + 150.at n=7A069477
- a(1) = 1; a(n) = Sum_{k=1..n-1} a(floor((n-1)/k)).at n=38A078346
- a(n) is the smallest number that is precisely n-tuply abundant.at n=42A081751
- Exponential convolution of A069321(n) with itself, where we set A069321(0)=0.at n=5A091345
- Numbers k such that 4^k - 2^k - 1 is prime.at n=28A098845