5429
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5580
- Proper Divisor Sum (Aliquot Sum)
- 151
- 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
- 5280
- Möbius Function
- 1
- Radical
- 5429
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 54
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Numerators of convergents to cube root of 2.at n=9A002352
- Number of factorization patterns of polynomials of degree n over F_5.at n=17A006170
- Coordination sequence T9 for Zeolite Code MFI.at n=47A008172
- Coordination sequence T6 for Zeolite Code NES.at n=47A008210
- Numbers k such that the continued fraction for sqrt(k) has period 23.at n=19A020362
- (d(n)-r(n))/5, where d = A026066 and r is the periodic sequence with fundamental period (0,3,1,0,1).at n=42A026068
- a(1) = 1; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=43A033680
- Numbers whose base-2 representation has exactly 11 runs.at n=35A043578
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 3, where m = 2^(p+1) + 2 - n and p is the unique number such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=14A049905
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=41A050049
- Numbers n such that 265*2^n-1 is prime.at n=18A050891
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 7.at n=12A051972
- McKay-Thompson series of class 42A for Monster.at n=44A058671
- Composite numbers not divisible by 7 which in base 7 contain their largest proper factor as a substring.at n=4A063877
- Numbers that define integer Heronian triangles [a(n), prime(a(n)), A068968(n)] with area A068969(n).at n=28A068967
- a(n) is the smallest number k such that A073813(k) = prime(n).at n=21A073814
- Sum of first n perfect powers.at n=30A076408
- Numbers k such that k#*2^k-1 is prime, where k# = product of primes <= k.at n=47A084406
- A Langford-like sequence.at n=35A108401
- a(n) is such that the a(n)-th composite number is (n-th prime)^2.at n=21A120389