Base | Representation |
---|---|
bin | 10110110010000111011110… |
… | …010000111001110000011011 |
3 | 111010210010100102211110120112 |
4 | 112302013132100321300123 |
5 | 101113143142340134321 |
6 | 553035414044514535 |
7 | 30051166465501415 |
oct | 2662073620716033 |
9 | 433703312743515 |
10 | 100201021021211 |
11 | 29a22018149760 |
12 | b2a376724ba4b |
13 | 43babb9b52486 |
14 | 1aa5a807539b5 |
15 | b8b6d26c8a5b |
hex | 5b21de439c1b |
100201021021211 has 32 divisors (see below), whose sum is σ = 116367676392960. Its totient is φ = 85374991187200.
The previous prime is 100201021021207. The next prime is 100201021021247. The reversal of 100201021021211 is 112120120102001.
It is not a de Polignac number, because 100201021021211 - 22 = 100201021021207 is a prime.
It is a super-2 number, since 2×1002010210212112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100201021021711) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5294480 + ... + 15114018.
It is an arithmetic number, because the mean of its divisors is an integer number (3636489887280).
Almost surely, 2100201021021211 is an apocalyptic number.
100201021021211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100201021021211 is a deficient number, since it is larger than the sum of its proper divisors (16166655371749).
100201021021211 is a wasteful number, since it uses less digits than its factorization.
100201021021211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9820387.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 100201021021211 its reverse (112120120102001), we get a palindrome (212321141123212).
The spelling of 100201021021211 in words is "one hundred trillion, two hundred one billion, twenty-one million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •