14460
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 40656
- Proper Divisor Sum (Aliquot Sum)
- 26196
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 7230
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 71
- 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
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of ternary necklaces of length n with no subsequence 00.at n=11A093331
- Structured truncated tetrahedral numbers.at n=19A100156
- Indices of primes in sequence defined by A(0) = 47, A(n) = 10*A(n-1) - 3 for n > 0.at n=22A101731
- Numbers k such that 4*k-1, 8*k-1, 16*k-1 and 32*k-1 are all primes.at n=8A101794
- A090801(2n-1)+A090801(2n).at n=32A140958
- a(n) = 16*n^2 + 2*n.at n=29A158056
- Numbers of the form prime(n)*(prime(n)-1)/4.at n=23A171555
- Numbers k such that 10^k*(4+3*10^k)+3 is prime.at n=7A171582
- G.f. satisfies: A(x) = 1 + x*Sum_{n>=0} (A(x)^2 - 1)^n.at n=7A192945
- Smallest k such that the number k^n in its decimal representation has a prime number of copies of the digit d for each d from 0 through 9.at n=34A217051
- Expansion of Product_{k>=1} ((1 + 2*x^k) * (1 + 3*x^k)).at n=14A266820
- First occurrence of 2,3, ... in A267376.at n=5A267377
- Sums of the cubes of the descent set statistics for permutations on n elements.at n=5A291902
- a(n) = prime(n) + prime(n+1) * prime(n+2).at n=28A293206
- A(n,k) is the sum of the k-th powers of the descent set statistics for permutations of [n]; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=41A334622