12300
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 36456
- Proper Divisor Sum (Aliquot Sum)
- 24156
- 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
- 1230
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 156
- 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
- Number of 6-dimensional partitions of n.at n=7A000416
- a(n) = (n-1)*n*(n+4)/6.at n=41A005581
- From descending subsequences of permutations.at n=7A006220
- Pisot sequence T(3,10), a(n) = floor(a(n-1)^2/a(n-2)).at n=7A018920
- Positive numbers k such that k and 2*k are anagrams in base 4 (written in base 4).at n=23A023059
- Values of Newton-Gregory forward interpolating polynomial (1/3)*(n-1)*(2*n+3)*(2*n-1).at n=21A030440
- n for which floor((3/2)^n) is prime.at n=24A070759
- Sum of squares of digits of n is equal to the largest prime factor of n reversed, where the largest prime factor is not a palindrome.at n=18A074303
- Column 5 of triangle A091602.at n=41A091608
- Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^9-M)/8, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=17A096043
- Least k such that (k*Mersenne-prime(n))^2 + 1 is prime.at n=22A098774
- Numbers k such that 13*k = A048720(29,k), where A048720 is carryless base-2 multiplication.at n=37A115805
- Integers i such that 10*i XOR 11*i = 21*i.at n=41A115829
- Terms of A068563 that are not terms of A124240.at n=47A124241
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=10.at n=17A135195
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (-1, 1, 0), (1, 0, 0), (1, 1, -1)}.at n=9A148647
- 4 times 9-gonal numbers: a(n) = 2*n*(7*n-5).at n=30A152760
- Number of reduced words of length n in the Weyl group B_41.at n=3A162178
- Number of reduced words of length n in the Weyl group D_41.at n=3A162403
- Even dodecagonal numbers: a(n) = 4*n*(5*n - 2).at n=25A193872