12000
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 3
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 39312
- Proper Divisor Sum (Aliquot Sum)
- 27312
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3200
- Möbius Function
- 0
- Radical
- 30
- Omega Function (Ω)
- 9
- 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
- 50
- 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
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Cubes written in base 6.at n=11A004636
- Erroneous version of A307102.at n=30A019513
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor((n+1)/2).at n=48A024305
- Galois numbers for p=5; order of group AGL(n,5).at n=2A028667
- Sorted Galois numbers.at n=33A028689
- Theta series of 8-d 5-modular lattice Q_8(1) with det 625 and minimal norm 4.at n=11A028976
- Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*10^j.at n=13A038228
- Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*3^j.at n=11A038305
- Numbers k such that phi(k) = phi(k - phi(k)).at n=45A051487
- Numbers whose sum of digits is 3.at n=29A052217
- Expansion of e.g.f. (1-x)/(1-5*x).at n=4A052675
- Successive positions in Tower of Hanoi (with three pegs {0,1,2}) where xyz means smallest disk is on peg z, second smallest is on peg y, third smallest on peg x, etc. and leading zeros indicate largest disks are all on peg 0.at n=23A055662
- Numbers k such that sigma(k+1) divides sigma(k), where sigma(k) is the sum of positive divisors of k.at n=21A058073
- Maximum size of Aut(G) where G is a finite group of order n.at n=49A059773
- Triangle T(n,k), n >= 2, n+1 <= k <= 2*n-1, number of permutations p of 1,...,n, with max(p(i)+p(i-1), i=2..n) = k.at n=25A064484
- Numbers k such that gcd(sigma(k), sigma(k+1)) > k.at n=31A066025
- Smallest multiple of n with digit sum = 3, or 0 if no such number exists, e.g. a(9k)= 0 = a(11k).at n=31A069522
- Denominator of Sum_{k=1..n} phi(k)/k^3.at n=5A072159
- Numbers in base -3.at n=27A073785
- Sum of squares of digits of n is equal to the largest prime factor of n.at n=28A074302