14370
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
- 16
- Divisor Sum
- 34560
- Proper Divisor Sum (Aliquot Sum)
- 20190
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3824
- Möbius Function
- 1
- Radical
- 14370
- Omega Function (Ω)
- 4
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = 1*t(n) + 2*t(n-1) + ...+ k*t(n+1-k), where k=floor((n+1)/2) and t is A001950 (upper Wythoff sequence).at n=38A023867
- Indices of primes in sequence defined by A(0) = 19, A(n) = 10*A(n-1) - 31 for n > 0.at n=22A102021
- Numbers k such that prime(k) +/- k and prime(k) +/- 2k are all primes.at n=3A112530
- Let f(n) = exp(Pi*sqrt(n)); sequence gives numbers n such that f(n) - floor(f(n)) < 1/10^3.at n=19A127028
- Let f(n) = exp(Pi*sqrt(n)); sequence gives numbers n such that f(n) - floor(f(n)) < 1/10^4.at n=3A127029
- a(n) = 16*n^2 - n.at n=29A157446
- a(n) = 64*n^2 - 2*n.at n=14A158067
- a(n) = 900*n^2 - 30.at n=3A158669
- The fourth row of the ED1 array A167546.at n=12A167547
- Wiener index of the Moebius ladder M(n).at n=29A180857
- Expansion of q^(1/4) * (eta(q) / eta(q^3))^3 in powers of q.at n=39A199659
- Triangle of coefficients of polynomials v(n,x) jointly generated with A207608; see Formula section.at n=61A207609
- Numbers of the form (prime(k) + Fibonacci(k))/2.at n=14A261543
- Numbers k such that Bernoulli number B_{k} has denominator 14322.at n=18A295588
- Expansion of Product_{k>=1} 1/(1 - x^k)^tau_k(k), where tau_k(k) = number of ordered k-factorizations of k (A163767).at n=13A304965
- Number of minimally 7-connected non-isomorphic n-vertex graphs.at n=11A324421
- a(n) is the number of distinct valid solutions taking into account the ambiguity of open and closed absolute value bars for an input of -1 to -2*(n)-1 with absolute value bars between each (|-1|, |-1|-2|-3|, |-1|-2|-3|-4|-5|, etc.).at n=9A332415
- Number of nonnegative lattice paths from (0,0) to (n,0) such that slopes of adjacent steps differ by at most one, assuming zero slope before and after the paths.at n=14A333647
- Number of integer partitions y of n whose rank Sum_i 2^(y_i-1) is prime.at n=47A372688