3062
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4596
- Proper Divisor Sum (Aliquot Sum)
- 1534
- 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
- 1530
- Möbius Function
- 1
- Radical
- 3062
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 61
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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) = a(n-2) + a(n-3) + a(n-4), with initial values a(0) = 0, a(1) = 2, a(2) = 3, a(3) = 6.at n=20A001634
- Numbers k such that 17*2^k - 1 is prime.at n=22A001774
- Magnetization series for face-centered cubic lattice.at n=24A003196
- Number of protruded partitions of n with largest part at most 5.at n=12A005406
- If a, b in sequence, so is ab+10.at n=21A009368
- Coordination sequence for MgZn2, Position Zn2.at n=14A009938
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A002808 (composite numbers).at n=26A023863
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (1, p(1), p(2), ...).at n=49A024369
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (primes).at n=48A024377
- Sequence A025513 divided by 2.at n=23A025514
- Numbers k such that k^2 is palindromic in base 11.at n=24A029996
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 54.at n=12A031552
- a(n) = floor(5*n^2/2).at n=35A032526
- First differences of A035407.at n=62A035417
- Number of partitions of n with equal nonzero number of parts congruent to each of 2 and 4 (mod 5).at n=38A035570
- a(n)=(s(n)+5)/9, where s(n)=n-th base 9 palindrome that starts with 4.at n=36A043075
- Numbers n such that string 6,2 occurs in the base 10 representation of n but not of n-1.at n=33A044394
- Numbers n such that string 6,2 occurs in the base 10 representation of n but not of n+1.at n=33A044775
- Numbers whose base-5 representation contains exactly three 2's and two 4's.at n=9A045291
- Numbers n such that 35*2^n-1 is prime.at n=19A050543