2429
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2784
- Proper Divisor Sum (Aliquot Sum)
- 355
- 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
- 2076
- Möbius Function
- 1
- Radical
- 2429
- 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
- 45
- 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
- Odd numbers not of form p + 2^k (de Polignac numbers).at n=55A006285
- Coordination sequence T1 for Zeolite Code AFI.at n=34A008014
- Twelve iterations of Reverse and Add are needed to reach a palindrome.at n=4A015993
- Coordination sequence T4 for Zeolite Code TER.at n=33A016436
- Concatenation of n and n + 5 or {n,n+5}.at n=23A032610
- a(n) = a(n-1)+ a(round(2*(n-1)/3)) +a(round((n-1)/3)) starting a(1)=1.at n=22A033498
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2 and 4 (mod 5).at n=45A035586
- a(n) = a(n-1) + prime(n-1), with a(1)=2.at n=36A036439
- Conjecturally, largest attractor in '3x+(2n+1)' problem.at n=17A039515
- Numbers whose base-7 representation contains exactly three 0's.at n=15A043395
- Numbers k such that the string 8,8 occurs in the base 9 representation of k but not of k-1.at n=29A044331
- Numbers n such that string 2,9 occurs in the base 10 representation of n but not of n-1.at n=27A044361
- Numbers n such that string 2,8 occurs in the base 9 representation of n but not of n+1.at n=33A044658
- Numbers n such that string 3,2 occurs in the base 9 representation of n but not of n+1.at n=32A044661
- Numbers n such that string 8,8 occurs in the base 9 representation of n but not of n+1.at n=29A044712
- Numbers n such that string 2,9 occurs in the base 10 representation of n but not of n+1.at n=27A044742
- Numbers n such that string 4,2 occurs in the base 10 representation of n but not of n+1.at n=26A044755
- Number of nonnegative solutions of x1^2 + x2^2 + ... + x7^2 = n.at n=34A045849
- 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=25A046254
- T(n,n+3), array T given by A047000.at n=6A047008