1439
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1440
- 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
- 1438
- Möbius Function
- -1
- Radical
- 1439
- 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
- 127
- 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
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 228
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n in which no parts are multiples of 3.at n=31A000726
- Primes with 7 as smallest primitive root.at n=13A001126
- Smallest prime == 7 (mod 8) where Q(sqrt(-p)) has class number 2n+1.at n=19A002146
- Lucasian primes: p == 3 (mod 4) with 2*p+1 prime.at n=23A002515
- Divisible only by primes congruent to 4 mod 7.at n=41A004622
- Sophie Germain primes p: 2p+1 is also prime.at n=46A005384
- Safe primes p: (p-1)/2 is also prime.at n=31A005385
- Smallest number of complexity n: smallest number requiring n 1's to build using + and *.at n=25A005520
- Worst cases for Pierce expansions (denominators).at n=18A006538
- Supersingular primes of the elliptic curve X_0 (11).at n=7A006962
- Noncubes such that some permutation of digits is a cube.at n=48A007940
- Coordination sequence T1 for Zeolite Code AEL.at n=25A008004
- Coordination sequence T5 for Zeolite Code BOG.at n=27A008053
- Coordination sequence T3 for Zeolite Code EMT.at n=31A008088
- Coordination sequence T1 for Zeolite Code LAU.at n=27A008124
- Coordination sequence T5 for Zeolite Code RSN.at n=25A009889
- Coordination sequence T3 for Zeolite Code RUT.at n=25A009899
- Triangle of rooted multi-edge stars with n edges by degree of root.at n=36A010360
- Numbers n such that phi(n + 9) | sigma(n) for n not congruent to 0 (mod 3).at n=29A015849
- Six iterations of Reverse and Add are needed to reach a palindrome.at n=24A015984