6075
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 11284
- Proper Divisor Sum (Aliquot Sum)
- 5209
- 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
- 3240
- Möbius Function
- 0
- Radical
- 15
- Omega Function (Ω)
- 7
- 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
- 62
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- yes
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers of the form 3^i*5^j with i, j >= 0.at n=28A003593
- Number of walks on cubic lattice.at n=26A005570
- 11*n^2 + 11*n + 3.at n=23A006222
- a(n) = (a(n-1) + 1)*a(n-2).at n=7A006277
- Number of strict 5th-order maximal independent sets in cycle graph.at n=49A007393
- Coordination sequence T4 for Zeolite Code NON.at n=47A008215
- a(n) = (2*n - 3)n^2.at n=15A015238
- a(n) = (-tau(n) + sigma_11(n)) / 691, where tau is Ramanujan's tau (A000594), sigma_11(n) = Sum_{ d divides n } d^11 (A013959).at n=3A027860
- Every run of digits of n in base 14 has length 2.at n=38A033012
- a(n) = 3*n^2.at n=45A033428
- Numbers whose prime factors are 3 and 5.at n=15A033849
- Composite numbers whose prime factors contain no digits other than 3 and 5.at n=39A036315
- Numbers k that divide 8^k + 7^k.at n=46A045604
- a(1)=4; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^{e_i+1}.at n=47A045967
- Odd numbers divisible by exactly 7 primes (counted with multiplicity).at n=3A046320
- Odd composite numbers divisible by the sum of their prime factors (counted with multiplicity).at n=21A046347
- Composites c whose decimal expansion ends with its largest prime factor.at n=25A050693
- Achilles numbers - powerful but imperfect: if n = Product(p_i^e_i) then all e_i > 1 (i.e., powerful), but the highest common factor of the e_i is 1, i.e., not a perfect power.at n=44A052486
- Numbers k such that k | 5^k + 4^k + 3^k + 2^k + 1^k.at n=34A056741
- Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.at n=36A056754