14889
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22720
- Proper Divisor Sum (Aliquot Sum)
- 7831
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8496
- Möbius Function
- -1
- Radical
- 14889
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 71
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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) = sum_{k=1..n} prime(k)*prime(k+1).at n=15A074745
- Interprimes (A024675) which are of the form s*prime, s=21.at n=31A075296
- Sum of composite numbers less than n-th prime.at n=43A079725
- Number of compositions of n into pairwise relatively prime parts.at n=21A101268
- Row sums of triangle A131404.at n=12A131405
- Binary order of n plus number of partitions of n-1.at n=35A163295
- Number of n X 2 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,2,1,0,0 for x=0,1,2,3,4.at n=10A197174
- a(n) = 7*n^2 + 2*n - 15.at n=45A239796
- Zeroless numbers n such that the products of the decimal digits of n and n^2 coincide.at n=3A257760
- Number of nonnegative solutions to (x_1)^2 + (x_2)^2 + ... + (x_10)^2 <= n.at n=12A341405
- Triangular array read by rows: T(n,k) is the number of square n-permutations possessing exactly k cycles; n >= 0, 0 <= k <= n.at n=50A349645