3051
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4560
- Proper Divisor Sum (Aliquot Sum)
- 1509
- 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
- 2016
- Möbius Function
- 0
- Radical
- 339
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 154
- 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
- Sum of squares of Fibonacci numbers 1,2,3,5,... that divide n.at n=54A005093
- Coordination sequence T1 for Zeolite Code MFI.at n=35A008161
- Coordination sequence T1 for Zeolite Code MWW.at n=37A024986
- Sequence A025513 divided by 2.at n=15A025514
- 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 55.at n=2A031553
- Greedy sequence such that no term is the average of four others.at n=49A037021
- The sequence e when b=[ 1,1,1,1,0,1,1,1,... ].at n=59A042959
- (s(n)+7)/10, where s(n)=n-th base 10 palindrome that starts with 3.at n=27A043082
- Numbers n such that string 5,1 occurs in the base 10 representation of n but not of n-1.at n=33A044383
- Numbers n such that string 5,1 occurs in the base 10 representation of n but not of n+1.at n=33A044764
- Numbers whose base-4 representation contains exactly three 2's and three 3's.at n=7A045151
- T(n,n-1), array T as in A047120.at n=7A047123
- Starting positions of strings of 2 6's in the decimal expansion of Pi.at n=24A050245
- Numbers k such that 287*2^k + 1 is a prime.at n=7A053360
- Integer part of log(n!)^(1 + log(1 + log(1 + n))).at n=16A062445
- Nearest integer to log(n!)^(1 + log(1 + log(1 + n))).at n=16A062446
- a(n) is twice the least possible area enclosed by a convex lattice n-gon.at n=42A070911
- Smallest multiple of the n-th prime such that the n-th partial sum is divisible by n.at n=29A074105
- Numbers k such that sigma(sigma(k)-k) = phi(k).at n=4A074875
- Smallest multiple of the n-th prime beginning with n.at n=29A078209