1409
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1410
- 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
- 1408
- Möbius Function
- -1
- Radical
- 1409
- 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
- 83
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 223
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 3, 9, 11 (mod 20) such that 2p+1 is also prime.at n=23A000355
- Irregular table read by rows: row n lists prime factors of 10^n + 1, with multiplicity.at n=49A001271
- Numbers that are the sum of 12 positive 7th powers.at n=11A003379
- Numbers k where |cos(k)| (or |cosec(k)| or |cot(k)|) decreases monotonically to 0; also numbers k where |tan(k)| (or |sec(k)|, or |sin(k)|) increases.at n=9A004112
- a(n) = floor(n*phi^8), where phi is the golden ratio, A001622.at n=30A004923
- a(n) = round(n*phi^8), where phi is the golden ratio, A001622.at n=30A004943
- a(1)=3, b(n) = Product_{k=1..n} a(k), a(n+1) is the smallest prime factor of b(n)-1.at n=48A005265
- Sophie Germain primes p: 2p+1 is also prime.at n=45A005384
- Prime-indexed primes: primes with prime subscripts.at n=47A006450
- Primes of form 3*k^2 - 3*k + 23.at n=21A007637
- Reve's puzzle: number of moves needed to solve the Towers of Hanoi puzzle with 4 pegs and n disks, according to the Frame-Stewart algorithm.at n=33A007664
- Numbers n such that n, 2n+1, and 4n+3 all prime.at n=12A007700
- Coordination sequence T3 for Zeolite Code DAC.at n=24A008069
- Coordination sequence T4 for Zeolite Code FER.at n=23A008109
- Crystal ball sequence for planar net 4.8.8.at n=32A008577
- Coordination sequence T5 for Zeolite Code VNI.at n=23A009911
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/31).at n=16A011941
- Powers of fifth root of 3 rounded down.at n=33A018120
- Powers of fifth root of 3 rounded to nearest integer.at n=33A018121
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MFI = ZSM-5 Nan[AlnSi96-nO192] starting with a T5 atom.at n=10A019162