5194
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 9234
- Proper Divisor Sum (Aliquot Sum)
- 4040
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2184
- Möbius Function
- 0
- Radical
- 742
- Omega Function (Ω)
- 4
- 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
- 147
- 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
- Coordination sequence T2 for Keatite.at n=40A009845
- Expansion of 1/(1-x^3-x^4-x^5-x^6-x^7-x^8-x^9-x^10-x^11).at n=27A017824
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 2), t = (Fibonacci numbers).at n=13A024872
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 2), t = (F(2), F(3), F(4), ...).at n=12A024874
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 0, 2, 1, 0.at n=17A025253
- Numbers whose set of base-8 digits is {1,2}.at n=39A032929
- Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 1,2,1.at n=4A037541
- Number of primes < n^3.at n=36A038098
- Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(2,5) and cn(1,5) + cn(4,5) <= cn(3,5).at n=40A039876
- Numbers having three 1's in base 9.at n=30A043459
- (Terms in A028273)/2.at n=29A051298
- Values of n such that 90n+11, 90n+13, 90n+17, 90n+19 are all primes.at n=33A051897
- Truncated triangular pyramid numbers: a(n) = Sum_{k=4..n} (k*(k+1)/2 - 9).at n=27A051937
- Numbers k such that 2^k - 15 is prime.at n=20A059612
- Numbers m such that [A070080(m), A070081(m), A070082(m)] is an acute scalene integer triangle with prime side lengths.at n=12A070123
- a(n) = 15n^2 + 13n^3.at n=7A085377
- Number of primes < prime(n)^3.at n=11A086688
- Numbers n such that 9*10^n + 5*R_n - 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=17A103100
- Number of positive integers <= 10^n that are divisible by no prime exceeding 7.at n=9A106600
- Numbers k such that A119682(k) is prime.at n=38A136682