14399
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19152
- Proper Divisor Sum (Aliquot Sum)
- 4753
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10560
- Möbius Function
- 0
- Radical
- 1309
- Omega Function (Ω)
- 4
- 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
- 164
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n^3 + n^2 - 1.at n=23A003777
- a(n) = Sum_{j=1..n} j*prime(j).at n=22A014285
- Number of partitions of n with equal nonzero number of parts congruent to each of 2 and 4 (mod 5).at n=47A035570
- Composite numbers whose prime factors contain no digits other than 1 and 7.at n=37A036307
- a(n) = (n!)^2 - 1.at n=4A046032
- Composite numbers with four prime factors (not necessarily distinct) whose concatenation yields a palindrome.at n=10A046453
- a(0)=4, a(1)=0, a(2)=0, a(3)=3; thereafter a(n) = a(n-3) + a(n-4).at n=48A050443
- Numbers n such that phi(n)+phi(n+1)=n+1.at n=26A067798
- Numbers n such that core(n)=floor(sqrt(n)), where core(x)=A007913(x) is the squarefree part of x and floor(sqrt(x))=A000196(x).at n=12A069186
- Smallest number a(n) == -1 (mod n) such that the prime signature of n and a(n) is the same, or 0 if no such number exists.at n=58A085075
- a(n) = n!^2 + (-1)^n.at n=4A089043
- Indices of highly composite triangular numbers.at n=23A101755
- Least j > 1 for n > 0 such that j^2 = (n^2 + 1)*(k^2) + (n^2 + 1)*k + 1 where k sequence = A106230.at n=24A106229
- 4-almost primes equal to the product of two successive semiprimes.at n=38A108215
- Numbers n where either n or n+1 is divisible by the numbers from 1 to 12.at n=3A131662
- Numbers k such that either k or k+1 is divisible by the numbers from 1 to 10.at n=21A131663
- a(n) = 9*n^2-1.at n=39A136016
- a(n) = 36n^2 - 1.at n=19A136017
- a(n) = 16n^2 + 32n + 15.at n=29A141759
- Composites c where |c-m| = 1, where m is any of the smallest positive integers with their number of divisors. (m belongs to sequence A007416.)at n=41A152246