14677
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15820
- Proper Divisor Sum (Aliquot Sum)
- 1143
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13536
- Möbius Function
- 1
- Radical
- 14677
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 40
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Pisot sequence P(4,10).at n=9A021004
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.at n=35A047826
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 17.at n=14A051982
- The sequence a[n]+b[n]+c[n]+d[n] defined in A126939.at n=8A126944
- Numbers k such that continued fraction of (1 + sqrt(k))/2 has period 17.at n=40A146340
- a(n) = (A216363(n) - 1)/118.at n=29A216380
- Numbers n such that 3^6*2^n - 1 is prime.at n=18A230527
- Numbers n such that 2*n + prime(n) is a square.at n=36A256246
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 813", based on the 5-celled von Neumann neighborhood.at n=6A273639
- Number of nX6 0..1 arrays with every element equal to 1, 2 or 4 king-move adjacent elements, with upper left element zero.at n=17A297856
- Number of compositions (ordered partitions) of n into octagonal pyramidal numbers (A002414).at n=54A322856
- Numbers m such that numbers m, m + 1, m + 2 and m + 3 have k, 2k, 3k and 4k divisors respectively.at n=9A340157
- Number of partitions of n into 5 or more distinct parts.at n=49A347572
- Numbers k such that k, k+1, k+2, k+3 have 2, 3, 4, 5 prime factors respectively, counted with multiplicity.at n=16A363391