14800
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 36518
- Proper Divisor Sum (Aliquot Sum)
- 21718
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5760
- Möbius Function
- 0
- Radical
- 370
- Omega Function (Ω)
- 7
- 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
- 133
- 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 partitions of floor(7n/2) into n nonnegative integers each no more than 7.at n=19A001979
- Glaisher's function G(n) (18 squares version).at n=10A002609
- a(n) = (2*n - 3)n^2.at n=20A015238
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (composite numbers).at n=24A024461
- a(n) = Sum_{k=0..floor(n/2)} T(n,k), T given by A026747.at n=13A026755
- Number of partitions in parts not of the form 21k, 21k+3 or 21k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=39A035981
- Numbers whose base-11 representation has exactly 5 runs.at n=24A043648
- Coefficients of replicable function number 15a.at n=47A058512
- a(n) = (2*n - 1)*(7*n^2 - 7*n + 6)/6.at n=18A063490
- Number of fibodd primes (A095081) in range [2^n,2^(n+1)].at n=18A095061
- p(11p-7) where p is prime.at n=11A098998
- a(n) = n*(20 + 15*n + n^2)/6.at n=39A101853
- Number of ways of packing a 3 X (2n-1) rectangle with dominoes, leaving one space unoccupied.at n=4A108550
- a(n) = 100^[n/10] + 2*n*10^[n/10]: inspired by Engel expansion of Pi.at n=24A137507
- a(n) = 361*n - 1.at n=40A158308
- The second left hand column of triangle A167552.at n=36A167554
- Even numbers k such that 6k+1, 12k+1, 18k+1, 36k+1 and 72k+1 are all primes.at n=9A206349
- Composite numbers n such that Sum_{d_<n | n} phi(d_<n) / (d_<n) is an integer, where d_<n = divisors of n that are less than n, phi(x) = A000010(x).at n=31A211778
- Expansion of (phi(-q^3)^2 / (phi(-q) * phi(-q^9)))^2 in powers of q where phi() is a Ramanujan theta function.at n=19A227587
- Number of (n+1) X (n+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=2A235018