14927
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 2353
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12760
- Möbius Function
- -1
- Radical
- 14927
- 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
- yes
- 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
- Numbers k such that 39*2^k + 1 is prime.at n=39A002269
- Quadrinomial coefficients: C(2+n,n) + C(3+n,n) + C(4+n,n).at n=21A005718
- Composite n such that phi(n) * sigma(n) is one less than a square.at n=37A015709
- Odd composite n such that phi(n) * sigma(n) is one less than a square.at n=15A015722
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t(n)=2*n+1 (odd numbers).at n=43A023865
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = natural numbers, t = odd natural numbers.at n=42A024862
- Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(0,5) < cn(2,5) = cn(3,5).at n=12A036885
- Numbers k such that 269*2^k + 1 is prime.at n=17A053351
- Numbers k such that gcd(3k,8^k+1) = 3 but k does not divide the numerator of B(2k) (the Bernoulli numbers).at n=22A070193
- Number of n-digit 7-smooth numbers (A002473).at n=19A085630
- Numbers k such that (k / sum of digits of k) and (k+1 / sum of digits of k+1) are both semiprime.at n=28A085774
- Numbers n such that 6*10^n+7 is prime.at n=18A103026
- a(n) = n*(n+1)*(8*n + 1)/6.at n=22A132124
- Products of 3 distinct safe primes.at n=38A157354
- G.f. is the polynomial (Product_{k=1..23} (1 - x^(3*k)))/(1-x)^23.at n=4A162680
- Number of partitions of n having population standard deviation < 2.at n=45A238658
- a(n) = Sum_{0<=i<j<=n}L(i)*L(j), where L(k)=A000032(k) is the k-th Lucas number.at n=9A242300
- Numbers n such that sigma(n+1) - sigma(n-1) = n+1.at n=3A260420
- Indices i where a run of nonzero values starts in A305671.at n=25A305672
- Composite numbers k such that phi(k) * psi(k) + 1 is a perfect square, where phi is the Euler totient function (A000010) and psi is the Dedekind psi function (A001615).at n=30A309653