5492
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 9618
- Proper Divisor Sum (Aliquot Sum)
- 4126
- 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
- 2744
- Möbius Function
- 0
- Radical
- 2746
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 129
- 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
- a(n) = ceiling(1000*log_2(n)).at n=44A004267
- Coordination sequence T7 for Zeolite Code VNI.at n=45A009913
- Coordination sequence for FeS2-Pyrite, Fe position.at n=36A009957
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 3), t = (Lucas numbers).at n=11A024877
- Discriminants of imaginary quadratic fields with class number 18 (negated).at n=37A046015
- Expansion of 2*x^2/(1 - 2*x - 2*x^2 + sqrt(1 - 4*x - 4*x^2)).at n=9A052705
- Number of basis partitions of n+25 with Durfee square size 5.at n=26A053800
- Triangle T(n,k) (n>=0, 0 <= k <= n) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R=(1,0), V=(0,1) and D=(1,2).at n=43A071943
- Triangle of numbers relating two simple context-free grammars (A052709 and A052705).at n=35A073152
- Interprimes which are of the form s*prime, s=4.at n=23A075279
- Sum of the first n primes whose indices are primes.at n=25A083186
- a(n) = S1(n,4), where S1(n,t) = Sum_{k=0..n} k^t * Sum_{j=0..k} binomial(n,j).at n=4A089661
- Smallest number which requires n iterations to reach a prime when iterating x + sum of squares of digits of x.at n=37A094658
- Values of n for which A095777(n) is 16 (those terms which are expressible in decimal digits for bases 2 through 17, but not for base 18).at n=11A095785
- Least positive integer that can be represented as sum of semiprime and a triangular number in exactly n ways. Triangular numbers include t(0)=0 and (1)=1.at n=44A100591
- Numbers formed by the third nesting of pi(10^n).at n=6A101225
- a(n) = sum{k=0..floor(n/2), C(2*n-3*k, n)*C(n-k, k)}.at n=7A105871
- Triangle in A071943 with rows reversed.at n=37A108073
- Lengths of bit runs in A123504.at n=40A123505
- a(n) is the number of Khalimsky-continuous functions with four-point codomain and an n-point range.at n=10A131935