Base | Representation |
---|---|
bin | 10011000000010011… |
… | …10010001100011100 |
3 | 222100001221210201012 |
4 | 21200021302030130 |
5 | 131343444042340 |
6 | 4404240034352 |
7 | 510562010600 |
oct | 114011621434 |
9 | 28301853635 |
10 | 10203112220 |
11 | 4366433254 |
12 | 1b890029b8 |
13 | c67ac4212 |
14 | 6cb115500 |
15 | 3eab2e565 |
hex | 26027231c |
10203112220 has 72 divisors (see below), whose sum is σ = 24940270656. Its totient is φ = 3496031616.
The previous prime is 10203112217. The next prime is 10203112261. The reversal of 10203112220 is 2221130201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 10203112195 and 10203112204.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2866682 + ... + 2870238.
It is an arithmetic number, because the mean of its divisors is an integer number (346392648).
Almost surely, 210203112220 is an apocalyptic number.
10203112220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10203112220 is an abundant number, since it is smaller than the sum of its proper divisors (14737158436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10203112220 is a wasteful number, since it uses less digits than its factorization.
10203112220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6507 (or 6498 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 10203112220 its reverse (2221130201), we get a palindrome (12424242421).
The spelling of 10203112220 in words is "ten billion, two hundred three million, one hundred twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •