10203
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
- 8
- Divisor Sum
- 14400
- Proper Divisor Sum (Aliquot Sum)
- 4197
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6408
- Möbius Function
- -1
- Radical
- 10203
- 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
- 179
- 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
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-10).at n=21A023440
- a(n)^2 has last digit equal to the sum of the other digits.at n=16A030134
- Concatenation of first n 2-digit positive integers including leading zeros.at n=2A030512
- Base-7 palindromes that start with 4.at n=28A043018
- a(n) = Sum_{d|n} p(d), where p(d) = A000041 = number of partitions of d.at n=32A047968
- a(n) is the smallest value of m such that A002378(m), the m-th oblong number, contains exactly n 1's.at n=4A048531
- p^2 + 2 where p is a prime.at n=25A061725
- 5-Smith numbers.at n=1A103126
- Each digit of a(n) appears in a(n+1) and a(n+1) > a(n) is minimal.at n=35A107411
- Numbers n such that a^r + b^r + c^r + ... is prime, where a*b*c* ... is the prime factorization of n and r is the product of the nonzero digits of n.at n=44A108697
- A123896 sorted and duplicates removed.at n=30A123902
- Numbers k such that 2^(k+1) + 3^k is prime.at n=44A123924
- a(n) = n-th prime * n-th nonprime.at n=40A127118
- One-third of the number of n X n nonnegative integer arrays with every 3 X 3 subblock summing to 1.at n=20A145052
- Triangle T(n, k, q) = q^k*Q(k, n, q), with T(0, 0, q) = -2, where Q(k, n, q) = (1/q)*( -Q(k-1, n, q) + (1+q)*p(q, k-1)^n), Q(k, 0, q) = -q*(1+q)^n, p(q, n) = Product_{j=1..n} ( (1-q^k)/(1-q) ), and q = 2, read by rows.at n=24A156222
- (100^n,1) Pascal triangle.at n=12A164847
- Numbers such that n^2 = 29 mod 1193.at n=17A165989
- Partial sums of A024785.at n=39A173060
- Base 2i representation of nonnegative integers.at n=11A212494
- Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 2 ("abcdefg" scheme: bits represent segments in clockwise order).at n=32A234692