14500
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 32760
- Proper Divisor Sum (Aliquot Sum)
- 18260
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5600
- Möbius Function
- 0
- Radical
- 290
- Omega Function (Ω)
- 6
- 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
- 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 different ways one can attack all squares on an n X n chessboard with the smallest number of non-attacking queens needed.at n=26A002568
- a(n) = 15n^2 + 13n^3.at n=10A085377
- Numbers n that are the hypotenuse of exactly 10 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 10 ways.at n=30A097225
- Structured truncated dodecahedral numbers.at n=9A100153
- Integers that are Rhonda numbers to base 8.at n=4A100970
- The common value of sigma_2 for square-amicable numbers, sigma_2(m)=sigma_2(n), m<n.at n=6A110929
- Sum of squares of four consecutive primes.at n=15A133524
- Partial sums of A003149.at n=7A174662
- Number of increasing sequences of n integers x(1),...,x(n) with values in 1..5*n such that x(j) divides x(k) iff j divides k.at n=23A180382
- Number of n X 4 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=25A208375
- Numbers k such that sum of square of prime divisors of k equals sum of prime divisors of k+1.at n=6A228181
- Numbers k such that, in the prime factorization of k, the sum of the primes equals the squared sum of exponents.at n=40A231230
- Plane partitions into odd parts.at n=23A242362
- Blease's b_n coefficients for 4-dimensional acyclic hypercubic lattice.at n=6A259898
- Numbers k such that the sum of digits of k^2 is 10.at n=40A262713
- Numbers k such that 4*10^k - 99 is prime.at n=22A278960
- a(n) = sigma_2(3*n).at n=33A283237
- A(n,k) is the n-th Rhonda number to base A002808(k), the k-th composite number; square array A(n,k), n>=1, k>=1, read by antidiagonals.at n=25A291925
- Numbers z such that x^2 + y^8 = z^2 for positive integers x and y.at n=41A293694
- Numbers k such that sum of digits (k) and sum of digits (k^2) is 10.at n=15A325451