Base | Representation |
---|---|
bin | 10110110010001111110101… |
… | …011101110010110100001011 |
3 | 111010210222112012202120122010 |
4 | 112302033311131302310023 |
5 | 101113320040023224321 |
6 | 553043501044031003 |
7 | 30051635136401052 |
oct | 2662176535626413 |
9 | 433728465676563 |
10 | 100210000211211 |
11 | 29a25905717040 |
12 | b2a5452392463 |
13 | 43bb9bb1c7757 |
14 | 1aa62930ad399 |
15 | b8ba5ab44676 |
hex | 5b23f5772d0b |
100210000211211 has 16 divisors (see below), whose sum is σ = 145928899537920. Its totient is φ = 60662958781920.
The previous prime is 100210000211177. The next prime is 100210000211231. The reversal of 100210000211211 is 112112000012001.
It is not a de Polignac number, because 100210000211211 - 214 = 100210000194827 is a prime.
It is a super-2 number, since 2×1002100002112112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100210000211231) 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, 1759338076 + ... + 1759395033.
It is an arithmetic number, because the mean of its divisors is an integer number (9120556221120).
Almost surely, 2100210000211211 is an apocalyptic number.
100210000211211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100210000211211 is a deficient number, since it is larger than the sum of its proper divisors (45718899326709).
100210000211211 is a wasteful number, since it uses less digits than its factorization.
100210000211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3518733986.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100210000211211 its reverse (112112000012001), we get a palindrome (212322000223212).
The spelling of 100210000211211 in words is "one hundred trillion, two hundred ten billion, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •