Base | Representation |
---|---|
bin | 10110110010000111011101… |
… | …000100111010011110011011 |
3 | 111010210010022001100102110202 |
4 | 112302013131010322132123 |
5 | 101113143122240214321 |
6 | 553035412053532415 |
7 | 30051166134254543 |
oct | 2662073504723633 |
9 | 433703261312422 |
10 | 100201001101211 |
11 | 29a2200798354a |
12 | b2a376064410b |
13 | 43babb59995aa |
14 | 1aa5a7bc4a323 |
15 | b8b6d0a9170b |
hex | 5b21dd13a79b |
100201001101211 has 8 divisors (see below), whose sum is σ = 100558837187424. Its totient is φ = 99843173872960.
The previous prime is 100201001101183. The next prime is 100201001101231. The reversal of 100201001101211 is 112101100102001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100201001101211 - 214 = 100201001084827 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100201001101192 and 100201001101201.
It is not an unprimeable number, because it can be changed into a prime (100201001101231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20879066 + ... + 25225728.
It is an arithmetic number, because the mean of its divisors is an integer number (12569854648428).
Almost surely, 2100201001101211 is an apocalyptic number.
100201001101211 is a deficient number, since it is larger than the sum of its proper divisors (357836086213).
100201001101211 is an equidigital number, since it uses as much as digits as its factorization.
100201001101211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4428981.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100201001101211 its reverse (112101100102001), we get a palindrome (212302101203212).
The spelling of 100201001101211 in words is "one hundred trillion, two hundred one billion, one million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •