6102
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
- 16
- Divisor Sum
- 13680
- Proper Divisor Sum (Aliquot Sum)
- 7578
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2016
- Möbius Function
- 0
- Radical
- 678
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 155
- 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) = prime(n)*(prime(n-1)-1)/2.at n=27A014302
- Exactly half of first a(n) terms of A022300 are 1's (not known to be infinite).at n=15A025513
- 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 78.at n=2A031576
- a(n)=(s(n)+4)/10, where s(n)=n-th base 10 palindrome that starts with 6.at n=32A043085
- Numbers which are the sum of their proper divisors containing the digit 0.at n=27A059461
- Numbers k such that sopf(k) = sopf(k+2), where sopf(k) = A008472(k).at n=7A063968
- Numbers k such that phi(k) divides sigma(k+1) + sigma(k).at n=41A067246
- Numbers n such that phi(n) = reversal(n).at n=6A069215
- Numbers n such that reverse(n) = phi(n) (mod n).at n=10A072392
- Numbers k such that reverse(phi(k)) = k.at n=5A072395
- Sum of first n 5-almost primes.at n=26A086047
- 6th diagonal of triangle in A059317.at n=13A106150
- Numbers such that the sum of the digits of floor(phi^n) is also the sum of the digits of the n-th Fibonacci number (in base 10), where phi is the golden ratio.at n=47A111366
- Numbers k such that the reverse of the representation of phi(k) is a substring of k, in base 10.at n=7A113622
- Numbers k such that the decimal digits of phi(k) are a permutation of those of k.at n=12A115921
- A sequence related to M-partitions.at n=48A117117
- Numbers k such that the number of prime divisors of the k-th Catalan number (counted with multiplicity) divides k.at n=26A121612
- Numbers k for which 8*k+1, 8*k+5 and 8*k+7 are primes.at n=40A123980
- Pairs (j, k) of numbers j<k such that phi(j) = phi(k), sigma(j) = sigma(k), d(j) = d(k).at n=18A134922
- Left edge of the triangle in A033291.at n=26A192735