14285
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17148
- Proper Divisor Sum (Aliquot Sum)
- 2863
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11424
- Möbius Function
- 1
- Radical
- 14285
- 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
- 32
- 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
- a(n) = ceiling(n*phi^17), where phi is the golden ratio, A001622.at n=4A004972
- a(0) = 1, a(n) = 27*n^2 + 2 for n>0.at n=23A010017
- 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 12.at n=10A031600
- a(n) = floor(10^5/n).at n=6A033427
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 9.at n=23A051974
- Number of nonempty subsequences {s(k)} of 1..n such that the difference sequence is palindromic.at n=21A053599
- Composite numbers, not ending with 0, sharing a 3-digit sequence with some of its prime factors.at n=11A131523
- A144325(n) + A144313(n) + A144315(n).at n=30A144715
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (-1, 1, 1), (1, -1, -1), (1, 1, 1)}.at n=8A149531
- (n^3 - n + 15)/3.at n=34A155757
- Hypotenuses c of primitive Pythagorean Triples (a,b,c) such that 2*a+1, 2*b+1 and 2*c+1 are primes.at n=32A165238
- Number of distinct values taken by 6th derivative of x^x^...^x (with n x's and parentheses inserted in all possible ways) at x=1.at n=14A199883
- Largest number that when multiplied by 7 produces an n-digit number.at n=4A241217
- Smallest base b > 1 such that both prime(n) and prime(n+1) are base-b Wieferich primes, i.e., p = prime(n) satisfies b^(p-1) == 1 (mod p^2) and q = prime(n+1) satisfies b^(q-1) == 1 (mod q^2).at n=25A259075
- a(n) = floor(((n mod 6)+1) * 10^floor((n/6)+1) / 7).at n=24A343915