Base | Representation |
---|---|
bin | 10011000000001100… |
… | …00000001110010110 |
3 | 222100000002110011102 |
4 | 21200012000032112 |
5 | 131343220333420 |
6 | 4404202510102 |
7 | 510550412216 |
oct | 114006001626 |
9 | 28300073142 |
10 | 10202121110 |
11 | 4365916655 |
12 | 1b88805332 |
13 | c6783806c |
14 | 6cad38246 |
15 | 3ea9d5a75 |
hex | 260180396 |
10202121110 has 32 divisors (see below), whose sum is σ = 18569023200. Its totient is φ = 4035502080.
The previous prime is 10202121053. The next prime is 10202121119. The reversal of 10202121110 is 1112120201.
It is a super-3 number, since 3×102021211103 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10202121091 and 10202121100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202121119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 308246 + ... + 339734.
It is an arithmetic number, because the mean of its divisors is an integer number (580281975).
Almost surely, 210202121110 is an apocalyptic number.
10202121110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10202121110 is a deficient number, since it is larger than the sum of its proper divisors (8366902090).
10202121110 is a wasteful number, since it uses less digits than its factorization.
10202121110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31856.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10202121110 its reverse (1112120201), we get a palindrome (11314241311).
Subtracting from 10202121110 its reverse (1112120201), we obtain a palindrome (9090000909).
The spelling of 10202121110 in words is "ten billion, two hundred two million, one hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •