Base | Representation |
---|---|
bin | 10110110010000111100010… |
… | …111110010000100111110011 |
3 | 111010210010112221111000211102 |
4 | 112302013202332100213303 |
5 | 101113143323101121321 |
6 | 553035425550035015 |
7 | 30051201445125251 |
oct | 2662074276204763 |
9 | 433703487430742 |
10 | 100201100020211 |
11 | 29a220587a6893 |
12 | b2a37897a8a6b |
13 | 43bac00322048 |
14 | 1aa5a8b0395d1 |
15 | b8b6d95d0c0b |
hex | 5b21e2f909f3 |
100201100020211 has 4 divisors (see below), whose sum is σ = 100201578240624. Its totient is φ = 100200621799800.
The previous prime is 100201100020199. The next prime is 100201100020337. The reversal of 100201100020211 is 112020001102001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100201100020211 - 222 = 100201095825907 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100201100020192 and 100201100020201.
It is not an unprimeable number, because it can be changed into a prime (100201100020811) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 238795775 + ... + 239215016.
It is an arithmetic number, because the mean of its divisors is an integer number (25050394560156).
Almost surely, 2100201100020211 is an apocalyptic number.
100201100020211 is a deficient number, since it is larger than the sum of its proper divisors (478220413).
100201100020211 is an equidigital number, since it uses as much as digits as its factorization.
100201100020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478220412.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100201100020211 its reverse (112020001102001), we get a palindrome (212221101122212).
The spelling of 100201100020211 in words is "one hundred trillion, two hundred one billion, one hundred million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •