Base | Representation |
---|---|
bin | 1001010001111001111011… |
… | …0001100100000111010110 |
3 | 1100010102021022210210101021 |
4 | 2110132132301210013112 |
5 | 2314132134021333420 |
6 | 33411142424351354 |
7 | 2102105040360400 |
oct | 224363661440726 |
9 | 40112238723337 |
10 | 10203211121110 |
11 | 3284180754017 |
12 | 118954a91555a |
13 | 59020a80b157 |
14 | 273ba3891b70 |
15 | 12a6202607aa |
hex | 9479ec641d6 |
10203211121110 has 48 divisors (see below), whose sum is σ = 21455967121056. Its totient is φ = 3483229852032.
The previous prime is 10203211121099. The next prime is 10203211121183. The reversal of 10203211121110 is 1112111230201.
It is a happy number.
10203211121110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 44570122 + ... + 44798461.
It is an arithmetic number, because the mean of its divisors is an integer number (446999315022).
Almost surely, 210203211121110 is an apocalyptic number.
10203211121110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10203211121110 is an abundant number, since it is smaller than the sum of its proper divisors (11252755999946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10203211121110 is a wasteful number, since it uses less digits than its factorization.
10203211121110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89368837 (or 89368830 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 10203211121110 its reverse (1112111230201), we get a palindrome (11315322351311).
The spelling of 10203211121110 in words is "ten trillion, two hundred three billion, two hundred eleven million, one hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •