14544
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 41106
- Proper Divisor Sum (Aliquot Sum)
- 26562
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 606
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 19
- 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
- Expansion of e.g.f. arctanh(sin(x)*exp(x)) = x+2/2!*x^2+4/3!*x^3+24/4!*x^4+180/5!*x^5...at n=7A012292
- Sin(n) decreases monotonically to -1.at n=25A046964
- Nonpalindromic numbers k such that k is not divisible by 10 and k*R(k) is a square, where R(k) is the reversal of k (A004086).at n=22A062917
- Number of ways of pairing the odd squares of the numbers 1 to n with the even squares of the numbers n+1 to 2n such that each pair sums to a prime.at n=27A077763
- a(0)=1; a(n) is the smallest integer > a(n-1) such that sin(a(n)) is closer to an integer (here 0 or -1) than sin(a(n-1)).at n=24A079037
- a(n) = sigma[k](n) - phi(n)^k - d(n)^k for k=3.at n=26A079539
- Numbers k such that all the following properties hold: (i) k*reverse(k) is a square; (ii) k != reverse(k); (iii) k and reverse(k) are not both squares; and (iv) k and reverse(k) have the same number of digits.at n=12A082994
- Triangular matrix T, read by rows, that satisfies: T^2 + 2*T = SHIFTUP(T), also T^(n+1) + 2*T^n = SHIFTUP(T^n - D*T^(n-1)) for all n, where D is a diagonal matrix with diagonal(D) = diagonal(T) = {1,2,3,...}.at n=41A103236
- Least positive k such that k * [RSA-200]^n - 1 is prime, where RSA-200 is the 200 decimal digit RSA challenge number A391940(15).at n=16A108375
- Times in hours, minutes and seconds (to the nearest second) at which the hour and minute hands of an analog clock, if interchanged, continue to indicate some other albeit accurate times, over a complete 12-hour sweep for the slower hand. Leading zeros omitted.at n=21A121577
- a(1) = 1, and for each k >=2, a(k) is the smallest number n such that n/cos(n) > a(k)/cos(a(k)), so that a(1)/cos(a(1)) > a(2)/cos(a(2)) > ... > a(k)/cos(a(k)) > ...at n=35A172446
- a(1) = 1, and for each n >=2, a(n) is the smallest number such that 1/cos(a(n)) < 1/cos(k) for all k < n, so that 1/cos(a(1)) > 1/cos(a(2)) > ... > 1/cos(a(n)) > ...at n=24A172448
- Number of parts that are visible in one of the three views of the shell model of partitions version "Tree" with n shells.at n=31A194803
- Number of n element 0..2 arrays with each element the minimum of 4 adjacent elements of a random 0..2 array of n+3 elements.at n=12A217879
- Shifts 9 places left under Euler transform with a(0)=0 and a(n)=1 for n<9.at n=36A218026
- Number of (n+4)X(n+4) 0..1 matrices with each 5X5 subblock idempotent.at n=9A224682
- Number T(n,k) of parity alternating permutations of [n] with exactly k descents from odd to even numbers; triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-1)/2)), read by rows.at n=28A232187
- Number of length n sequences on alphabet {0,1,2} that contain all of 00, 01, 02, 10, 11, 12, 20, 21, 22 as (possibly overlapping) contiguous subsequences.at n=2A243862
- Partial sums of A243980.at n=22A244050
- Least integer m > 0 with pi(m*n) = sigma(m), where sigma(m) is the sum of all positive divisors of m.at n=32A247603