3026
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
- 8
- Divisor Sum
- 4860
- Proper Divisor Sum (Aliquot Sum)
- 1834
- 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
- 1408
- Möbius Function
- -1
- Radical
- 3026
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 66
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Numbers that are the sum of 2 positive 4th powers.at n=25A003336
- Numbers that are the sum of at most 2 nonzero 4th powers.at n=33A004831
- Sum of 4th powers of primes dividing n.at n=34A005065
- Sum of 4th powers of odd primes dividing n.at n=34A005068
- Coordination sequence T2 for Zeolite Code ERI.at n=40A008094
- Coordination sequence T1 for Zeolite Code KFI.at n=42A008123
- Coordination sequence T2 for Zeolite Code MAZ.at n=38A008145
- a(0) = 1, a(n) = 21*n^2 + 2 for n>0.at n=12A010011
- a(n) = n*(21*n-1)/2.at n=17A022278
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A008578 ({1} U primes).at n=21A023862
- a(n) = 1*prime(n) + 2*prime(n-1) + ... + k*prime(n+1-k), where k=floor((n+1)/2) and prime(n) is the n-th prime.at n=20A023870
- a(n) = s(n+3)/5, where s is A024951.at n=10A024952
- a(n) = (d(n)-r(n))/5, where d = A026043 and r is the periodic sequence with fundamental period (0,2,3,0,0).at n=32A026045
- Number of 5-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=5.at n=12A027560
- Number of partitions of n in which no parts are multiples of 5.at n=30A035959
- a(n)=(s(n)+5)/9, where s(n)=n-th base 9 palindrome that starts with 4.at n=32A043075
- Numbers k such that the string 3,2 occurs in the base 9 representation of k but not of k-1.at n=41A044280
- Numbers n such that string 2,6 occurs in the base 10 representation of n but not of n-1.at n=33A044358
- Numbers n such that string 2,6 occurs in the base 10 representation of n but not of n+1.at n=33A044739
- Sums of two squares of Fibonacci numbers.at n=46A045702