14283
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22120
- Proper Divisor Sum (Aliquot Sum)
- 7837
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9108
- Möbius Function
- 0
- Radical
- 69
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 32
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=3, a(1)=11.at n=16A022410
- Discriminants of totally complex sextic fields (negated).at n=6A023687
- Numbers n such that n*phi(n-1) is a perfect square.at n=18A069069
- Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 6 and (n+7) mod 9 <> 1.at n=11A096025
- Powerful(1) numbers (A001694) which are the sum of distinct double factorials (A006882).at n=44A115651
- Number of different strings of length n+4 obtained from "123...n" by iteratively duplicating any substring.at n=19A137741
- Powerful happy numbers; if a prime p divides n then p^2 must also divide n and also n must have trajectory under iteration of sum of squares of digits map includes 1.at n=35A140172
- Numbers of the form p^2 * q^3, where p,q are distinct primes.at n=28A143610
- a(n) = n^3 + sum((-1)^j*a(j)); for j=1 to n-1; a(1)=1.at n=40A153286
- a(n) = (n^3 - n + 9)/3.at n=34A155753
- Number of lines through at least 2 points of a 7 X n grid of points.at n=36A160847
- Odd numbers k such that A166100((k-1)/2)/k is not an integer.at n=19A166102
- a(n) = Sum_{k=0..n} binomial(n,k)^3 * 2^k.at n=5A206178
- Numbers of the form p^2*q^3 where p, q are (not necessarily distinct) primes.at n=31A216417
- Number of idempotent 3X3 -n..n matrices of rank 2.at n=9A223452
- Number of partitions of n having (sum of odd parts) > (sum of even parts).at n=38A239262
- Number of partitions of n having (sum of odd parts) >= (sum of even parts).at n=38A239263
- Number of partitions of n with difference -5 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=43A242687
- a(n) = 27*n^2.at n=23A244634
- Achilles numbers which are coprime to the sum of their divisors.at n=22A248022