10124
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 17724
- Proper Divisor Sum (Aliquot Sum)
- 7600
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5060
- Möbius Function
- 0
- Radical
- 5062
- Omega Function (Ω)
- 3
- 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
- 42
- 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
- Generalized Fibonacci numbers.at n=7A006603
- Dodecahedral surface numbers: a(0)=0, a(1)=1, a(2)=20, thereafter 2*((3*n-7)^2 + 21).at n=26A007589
- Sum of digits in n-th term of A022482.at n=28A022487
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 56 ones.at n=20A031824
- Numerators of continued fraction convergents to sqrt(23).at n=8A041036
- Numbers whose base-10 representation has exactly 5 runs.at n=12A043641
- Numbers k such that k^2 contains exactly 9 different digits.at n=0A054037
- a(n)^2 is the least square to contain n different decimal digits.at n=8A054039
- Numbers k such that k^14 == 1 (mod 15^3).at n=11A056087
- An approximation to sigma_{5/2}(n): floor( sum_{d|n} d^(5/2) ).at n=38A058272
- Least number whose digits can be used to form exactly n different primes (not necessarily using all digits).at n=22A076449
- a(n) = 5*n^2 - 1.at n=44A134538
- a(n) = 4*(5*n^2 - 5*n + 1).at n=22A193448
- G.f.: Sum_{n>=0} x^n * Product_{k=1..n} (k + n*x) / (1 + k*x + n*x^2).at n=9A204064
- Numbers which may represent a date in "condensed European notation" DDMMYY.at n=24A213182
- Numbers which may represent a date in "condensed American notation" MMDDYY.at n=24A213184
- Braille natural numbers (including zero), using "0" as digit concatenation mark.at n=16A220090
- a(n) is the smallest integer that makes A230762(n) the commonest number of decompositions of 2k into an unordered sum of two odd primes, where 3 <= k <= a(n).at n=20A230822
- Number of length n+4 0..3 arrays with no five consecutive terms having four times any element equal to the sum of the remaining four.at n=2A249461
- T(n,k)=Number of length n+4 0..k arrays with no five consecutive terms having four times any element equal to the sum of the remaining four.at n=12A249466