10245
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 6171
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5456
- Möbius Function
- -1
- Radical
- 10245
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 148
- 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
- no
- Odd
- yes
Appears in sequences
- Divisors of 2^44 - 1.at n=25A003549
- Numbers that are the sum of 10 positive 11th powers.at n=5A004821
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A000201 (lower Wythoff sequence).at n=20A024474
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=27A025114
- Numbers with exactly five distinct base-10 digits.at n=7A031987
- Number of partitions of n into parts not of the form 25k, 25k+10 or 25k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=33A036009
- Number of step cyclic shifted sequences using exactly three different symbols.at n=12A056416
- Number of primitive (period n) step cyclic shifted sequences using exactly three different symbols.at n=12A056425
- Interprimes which are of the form s*prime, s=15.at n=38A075290
- Records in A086068.at n=13A086069
- Numbers k such that 2^(2*(k+1)) + 2^k + 1 is prime.at n=17A105182
- (k-1)/2 where k runs over odd terms of A001372.at n=9A129834
- Inverse Moebius transform of A037019.at n=32A130114
- Smallest n-digit number with distinct digits such that every k-digit substring (k <= n) taken from the left is divisible by k (k = 1..n).at n=4A158242
- Products of 3 distinct primes whose binary expansion is palindromic.at n=39A168355
- Row sums of triangle A182702.at n=14A182706
- Number of zero-sum -4..4 arrays of n elements with first through fourth differences also in -4..4.at n=8A201435
- Numbers n such that 4*11^n - 1 is prime.at n=8A205521
- Braille natural numbers (including zero), using "0" as digit concatenation mark.at n=10A220090
- a(n) = 5*2^n + 5.at n=11A231643