2029
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2030
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 2028
- Möbius Function
- -1
- Radical
- 2029
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 37
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 308
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- A variant of the cuban primes: primes p = (x^3 - y^3)/(x - y) where x = y + 2.at n=7A002648
- Number of bipartite partitions.at n=9A002764
- Mian-Chowla sequence (a B_2 sequence): a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise sums of elements are all distinct.at n=35A005282
- Primes of form k^2 + 4.at n=11A005473
- Numbers k such that (11^k - 1)/10 is prime.at n=6A005808
- From relations between Siegel theta series.at n=21A006476
- Smallest odd number expressible in at least n ways as p+2*m^2 where p is 1 or a prime and m >= 0.at n=24A007697
- a(n) = n OR n^2 (applied to binary expansions).at n=44A007745
- Primes that divide at least one term of Sylvester's sequence s = A000058: s(n+1) = s(n)^2 - s(n) + 1, s(0) = 2.at n=15A007996
- Coordination sequence T2 for Zeolite Code CAS.at n=28A008064
- Coordination sequence T1 for Zeolite Code EMT.at n=37A008086
- Coordination sequence T4 for Zeolite Code -CLO.at n=39A009853
- Numbers k such that the continued fraction for sqrt(k) has period 5.at n=43A010337
- a(n) is prime and sum of all primes <= a(n) is prime.at n=30A013917
- Least d for which the number with continued fraction [n,n,n,n...] is in Q(sqrt(d)).at n=44A013946
- Powers of fourth root of 6 rounded up.at n=17A018062
- Fibonacci sequence beginning 5, 11.at n=12A022136
- Place where n-th 1 occurs in A023127.at n=40A022789
- Number of solutions to c(1)*prime(4) + ... + c(n)*prime(n+3) = 0, where c(i) = +-1 for i>1, c(1) = 1.at n=19A022903
- Primes that remain prime through 2 iterations of the function f(x) = 3*x + 2.at n=24A023246