1429
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1430
- 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
- 1428
- Möbius Function
- -1
- Radical
- 1429
- 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
- 34
- 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
- 226
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p of the form 3k+1 such that -sqrt(p) < sum_{x=1..p} cos(2*Pi*x^3/p) < sqrt(p).at n=32A000922
- Primes with 6 as smallest primitive root.at n=14A001125
- Catalan numbers - 1.at n=6A001453
- From a Goldbach conjecture: records in A185091.at n=22A002092
- Number of partitions of n into parts 5k+1 or 5k+4.at n=53A003114
- Numbers divisible only by primes congruent to 1 mod 7.at n=38A004619
- Primes p such that 2p-1 is also prime.at n=42A005382
- Truncated square numbers: 7*n^2 + 4*n + 1.at n=14A005892
- a(n) = 2*a(n-1) + a(n-2) - a(n-3), with a(0) = a(1) = 0, a(2) = 1.at n=11A006054
- Greater of twin primes.at n=46A006512
- Primes with both 10 and -10 as primitive root.at n=43A007349
- Coordination sequence T6 for Zeolite Code DFO.at n=29A009880
- Apply partial sum operator thrice to primes.at n=9A014150
- Six iterations of Reverse and Add are needed to reach a palindrome.at n=23A015984
- Numbers k such that the continued fraction for sqrt(k) has period 11.at n=12A020350
- n-th prime p(k) such that p(k) + p(k+4) = p(k+1) + p(k+3).at n=41A022887
- Primes p such that p + 4 is also prime.at n=49A023200
- Primes p such that 4*p+1 is also prime.at n=41A023212
- Primes p such that 7*p + 4 is also prime.at n=40A023224
- Numbers k such that k and 8*k + 5 are both prime.at n=47A023230