10230
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
- 32
- Divisor Sum
- 27648
- Proper Divisor Sum (Aliquot Sum)
- 17418
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2400
- Möbius Function
- -1
- Radical
- 10230
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 60
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Theta series of A_10 lattice.at n=3A008450
- a(n) = floor(binomial(n,4)/4).at n=33A011850
- Positive numbers k such that k and 3*k are anagrams in base 4 (written in base 4).at n=3A023060
- Positive numbers k such that k and 3*k are anagrams in base 7 (written in base 7).at n=11A023069
- Theta series of A*_10 lattice.at n=33A023922
- Numbers k whose decimal representation, read as a base-22 value and divided by k, yields an integer.at n=20A032575
- Products of exactly 5 distinct primes.at n=25A046387
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x.at n=25A050788
- Numbers that are divisible by exactly 5 different primes.at n=34A051270
- a(n) = n*(2^n - 1).at n=10A066524
- Reverse of largest prime factor of n = smallest prime factor of n+1; a(1)=1.at n=11A071393
- a(n) = rad(n*(n+1)*(n+2)*(n+3)).at n=29A078638
- Numbers n such that the denominator of the 2n-th Bernoulli number is divisible by n but sum_{d|n} sigma(d)/phi(d) is not an integer.at n=7A099008
- Number of rooted ordered trees where no branch is identical to its adjacent neighbor.at n=11A106361
- Numbers n such that n divides the denominator of 2n-th Bernoulli number.at n=29A106741
- Each digit of a(n) appears in a(n+1) and a(n+1) > a(n) is minimal.at n=38A107411
- Numbers n such that a(n) is prime, where a(n) = a(n-1) + a(n-2), a(1) = 3794765361567513, a(2) = 20615674205555510.at n=9A108156
- a(n) = n*(n+13)*(n+14)/6.at n=31A111144
- Number of Dyck paths such that the sum of the peak-abscissae is n.at n=46A129528
- Numbers n such that n is divisible by (3*s(n)*s(n)+2), where s(n) = sum of digits of n.at n=36A134556