Base | Representation |
---|---|
bin | 101101111100111100010011… |
… | …011011100101010010100011 |
3 | 222111120120110022220112222011 |
4 | 231330330103123211102203 |
5 | 202442201311100023021 |
6 | 1553455244105053351 |
7 | 60366146462612260 |
oct | 5574742333452243 |
9 | 874516408815864 |
10 | 202100012111011 |
11 | 59439152111433 |
12 | 1a800405187257 |
13 | 889cc459b3361 |
14 | 37c999ada8267 |
15 | 1857142399de1 |
hex | b7cf136e54a3 |
202100012111011 has 4 divisors (see below), whose sum is σ = 230971442412592. Its totient is φ = 173228581809432.
The previous prime is 202100012110981. The next prime is 202100012111069. The reversal of 202100012111011 is 110111210001202.
It is a happy number.
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 202100012111011 - 213 = 202100012102819 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202100012110982 and 202100012111000.
It is not an unprimeable number, because it can be changed into a prime (202100012111071) 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, 14435715150780 + ... + 14435715150793.
It is an arithmetic number, because the mean of its divisors is an integer number (57742860603148).
Almost surely, 2202100012111011 is an apocalyptic number.
202100012111011 is a deficient number, since it is larger than the sum of its proper divisors (28871430301581).
202100012111011 is an equidigital number, since it uses as much as digits as its factorization.
202100012111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28871430301580.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 202100012111011 its reverse (110111210001202), we get a palindrome (312211222112213).
The spelling of 202100012111011 in words is "two hundred two trillion, one hundred billion, twelve million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •