14990
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 27000
- Proper Divisor Sum (Aliquot Sum)
- 12010
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5992
- Möbius Function
- -1
- Radical
- 14990
- 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
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) is least k such that k and 8k are anagrams in base n (written in base 10).at n=2A023100
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A000201 (lower Wythoff sequence).at n=23A025107
- Numbers n such that 1n1, 3n3, 7n7 and 9n9 are all primes.at n=28A059677
- Number of surviving Collatz residues mod 2^n.at n=19A076227
- Sums of three consecutive heptagonal numbers.at n=44A129111
- Triangle read by rows: T(n,k) is the number of permutations p of [n] for which k is the smallest among the positive differences p(i+1) - p(i); k=0 for the reversal of the identity permutation (0<=k<=n-1).at n=40A180190
- Number of rhombuses on a (n+1)X9 grid.at n=39A190097
- Number of (n+1)X(n+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two, and every 2X2 determinant nonzero.at n=1A206310
- Number of (n+1)X3 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two, and every 2X2 determinant nonzero.at n=1A206312
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two, and every 2X2 determinant nonzero.at n=4A206318
- a(n) = k, index of A165959(k) at record values.at n=15A230146
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 777", based on the 5-celled von Neumann neighborhood.at n=25A273532
- Number of factorizations of n! into factors > 1 that can be obtained by taking the block-products of some set partition of {2,3,...,n}.at n=10A321467
- a(n) = Sum_{1 <= i <= j <= k <= n} gcd(i,j,k).at n=38A344521
- Sorted positions of first appearances in A057820, the sequence of first differences of prime-powers.at n=44A376340