8669
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 8670
- 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
- 8668
- Möbius Function
- -1
- Radical
- 8669
- 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
- 140
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1079
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.at n=17A001210
- Numbers k such that the continued fraction for sqrt(k) has period 29.at n=22A020368
- Primes that remain prime through 3 iterations of function f(x) = 7x + 6.at n=15A023290
- Primes that remain prime through 3 iterations of function f(x) = 10x + 3.at n=26A023300
- Primes that remain prime through 4 iterations of function f(x) = 7x + 6.at n=5A023318
- Numbers whose set of base-14 digits is {2,3}.at n=25A032814
- Primes that do not contain any other prime as a proper substring.at n=47A033274
- Number of partitions satisfying cn(0,5) + cn(1,5) < cn(2,5) + cn(3,5) and cn(0,5) + cn(4,5) < cn(2,5) + cn(3,5).at n=37A039884
- Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) <= cn(1,5) and cn(0,5) + cn(2,5) + cn(3,5) <= cn(4,5).at n=44A039908
- Primes whose digits are composite; primes having only {4, 6, 8, 9} as digits.at n=13A051416
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 23.at n=15A051964
- Primes followed by an [8,4,8]=[d,D-d,d] prime difference pattern of A001223.at n=4A052377
- Primes having only {0, 6, 8, 9} as digits.at n=10A053580
- First member of a prime triple in a p^2 + p - 1 progression.at n=38A057324
- Primes having only 0,4,6,8,9 as digits.at n=24A061372
- Primes with either no internal digits or all internal digits are 6.at n=49A069681
- Prime numbers using only the curved digits 0, 3, 6, 8 and 9.at n=39A079652
- Primes whose 10's complement is a palindrome.at n=32A083017
- Primes whose 10's complement is a cube.at n=4A083018
- a(1) = 1; then the smallest number such that both the forward and reverse n-th partial concatenation is a prime for n > 1. (Reverse concatenation is taken term-wise and not digit-wise.)at n=19A083992