Base | Representation |
---|---|
bin | 10110110010001001010100… |
… | …110100010101101001111011 |
3 | 111010210022111001111011201211 |
4 | 112302021110310111221323 |
5 | 101113211231031201021 |
6 | 553040343300023551 |
7 | 30051266666642521 |
oct | 2662112464255173 |
9 | 433708431434654 |
10 | 100203010022011 |
11 | 29a22948963476 |
12 | b2a4021391bb7 |
13 | 43bb145c48220 |
14 | 1aa5bcc988311 |
15 | b8b79c1173e1 |
hex | 5b2254d15a7b |
100203010022011 has 16 divisors (see below), whose sum is σ = 108627182334720. Its totient is φ = 91881177040800.
The previous prime is 100203010021991. The next prime is 100203010022029. The reversal of 100203010022011 is 110220010302001.
It is a cyclic number.
It is not a de Polignac number, because 100203010022011 - 25 = 100203010021979 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100203010021982 and 100203010022000.
It is not an unprimeable number, because it can be changed into a prime (100203010022711) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 147048000 + ... + 147727858.
It is an arithmetic number, because the mean of its divisors is an integer number (6789198895920).
Almost surely, 2100203010022011 is an apocalyptic number.
100203010022011 is a deficient number, since it is larger than the sum of its proper divisors (8424172312709).
100203010022011 is a wasteful number, since it uses less digits than its factorization.
100203010022011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 755106.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 100203010022011 its reverse (110220010302001), we get a palindrome (210423020324012).
The spelling of 100203010022011 in words is "one hundred trillion, two hundred three billion, ten million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •