5229
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 8736
- Proper Divisor Sum (Aliquot Sum)
- 3507
- 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
- 2952
- Möbius Function
- 0
- Radical
- 1743
- 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
- 178
- 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
- no
- Odd
- yes
Appears in sequences
- Powers of fifth root of 7 rounded down.at n=22A018132
- Powers of fifth root of 7 rounded to nearest integer.at n=22A018133
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite DFO = DAF-1 [Mg14Al52P66O264].7R.40H2O starting with a T5 atom.at n=5A019009
- Numbers that are the sum of 4 distinct positive cubes in exactly 3 ways.at n=24A025410
- Numbers that are the sum of 4 distinct positive cubes in 3 or more ways.at n=25A025413
- a(n) = dot_product(1,2,...,n)*(7,8,...,n,1,2,3,4,5,6).at n=20A026049
- Numerators of continued fraction convergents to sqrt(434).at n=5A041826
- Number of n-digit numbers with maximal multiplicative persistence A014553.at n=6A046148
- Larger members of g-reduced amicable pairs a < b such that sigma(a) = sigma(b) = a + b + gcd(a,b).at n=20A054572
- Numbers with more than one factorization into S-primes. See A054520 and A057948 for definition.at n=29A057949
- Numbers primitive with respect to having more than one factorization into S-primes. See related sequences for definition.at n=26A057950
- Coefficients in the series (1 + x^2 + x^3 + x^5 + x^7 + x^11 + x^13 + ... )/(1 - x - x^4 - x^6 - x^8 - x^9 - x^10 - x^12 - x^14 - ... ).at n=21A058355
- Positive numbers whose product of digits is 10 times their sum.at n=22A062043
- a(n) = 3*n*(4*n-1).at n=21A062783
- Least k such that gcd(prime(k)+1, prime(k+1)+1) = 2n.at n=18A067603
- a(1) = 10; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=41A074346
- Sums of groups in A075643.at n=19A075645
- Out of all the n-digit primes, which one takes the longest time to appear in the digits of Pi (ignoring the initial 3)? The answer is A076106(n) and the position where this prime appears is a(n).at n=2A076130
- a(n) = Pell(n+2) - 2^n.at n=9A094723
- Lower triangular matrix T, read by rows, such that the row sums of T^n form the (3n)-dimensional partition numbers.at n=71A096653