10429
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10430
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10428
- Möbius Function
- -1
- Radical
- 10429
- 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
- 86
- 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
- 1276
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Sum along upward diagonal of Pascal triangle to halfway point.at n=22A010754
- Sum along upward diagonal of Pascal triangle up to (but not including) halfway point.at n=22A010755
- a(n) = Sum_{k=0..n} ceiling(k^3/n).at n=33A014813
- Primes that remain prime through 3 iterations of function f(x) = 5x + 8.at n=19A023286
- [ exp(8/11)*n! ].at n=6A030940
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 40.at n=1A031628
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 60 ones.at n=23A031828
- T(n,n-6), array T as in A038730.at n=5A038735
- T(n,n-5), array T as in A038792.at n=17A038795
- Primes p whose period of reciprocal equals (p-1)/11.at n=2A056216
- Number of ordered triples (a, b, c) with gcd(a, b, c) = 1 and 1 <= {a, b, c} <= n.at n=22A071778
- Five-digit distinct-digit primes.at n=10A074671
- For n < 5, a(n) = n-th prime. For n >= 5, let m = n-th prime. If m is a k-digit prime then a(n) = smallest prime obtained by inserting at least one digit between every pair of digits of m. There are (k-1) places where digit insertion takes place and a(n) contains at least 2k-1 digits.at n=34A080437
- Primes which when added to their own rotation yield a prime.at n=40A086002
- Prime(p)-4 for primes p such that prime(p) - 4 is prime.at n=26A094069
- Duplicate of A056216.at n=2A098678
- Diagonal sums of triangle A099575.at n=20A099577
- Largest prime factor of n!! + (n+1)!!.at n=23A118333
- a(n) = (n^6 - 126*n^5 + 6217*n^4 - 153066*n^3 + 1987786*n^2 - 13055316*n + 34747236)/36.at n=12A121888
- Least generalized Wilson prime p such that p^2 divides (n-1)!(p-n)! - (-1)^n; or 0 if no such prime exists.at n=3A128666