Base | Representation |
---|---|
bin | 1001010001101110000010… |
… | …1000101001000011101110 |
3 | 1100010010001000020111012111 |
4 | 2110123200220221003232 |
5 | 2314104120401023042 |
6 | 33405454111354234 |
7 | 2101633013625421 |
oct | 224334050510356 |
9 | 40103030214174 |
10 | 10200021111022 |
11 | 3282894004246 |
12 | 11889ba52297a |
13 | 58cb1c959712 |
14 | 27397dd479b8 |
15 | 12a4d5187517 |
hex | 946e0a290ee |
10200021111022 has 8 divisors (see below), whose sum is σ = 15304035873672. Its totient is φ = 5098675819800.
The previous prime is 10200021110971. The next prime is 10200021111031. The reversal of 10200021111022 is 22011112000201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10200021110993 and 10200021111011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 667358304 + ... + 667373587.
It is an arithmetic number, because the mean of its divisors is an integer number (1913004484209).
Almost surely, 210200021111022 is an apocalyptic number.
10200021111022 is a deficient number, since it is larger than the sum of its proper divisors (5104014762650).
10200021111022 is a wasteful number, since it uses less digits than its factorization.
10200021111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1334735714.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10200021111022 its reverse (22011112000201), we get a palindrome (32211133111223).
The spelling of 10200021111022 in words is "ten trillion, two hundred billion, twenty-one million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •