Base | Representation |
---|---|
bin | 1011101101001101001… |
… | …0000011111101101111 |
3 | 201020002221000021101202 |
4 | 2323103102003331233 |
5 | 11243334441114043 |
6 | 232220134200115 |
7 | 20346526122116 |
oct | 2732322037557 |
9 | 636087007352 |
10 | 201113223023 |
11 | 78323198129 |
12 | 32b884b303b |
13 | 15c70b4c71b |
14 | 9a3bca2c7d |
15 | 537106d1b8 |
hex | 2ed3483f6f |
201113223023 has 2 divisors, whose sum is σ = 201113223024. Its totient is φ = 201113223022.
The previous prime is 201113223011. The next prime is 201113223037. The reversal of 201113223023 is 320322311102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201113223023 - 28 = 201113222767 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201113222986 and 201113223004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201113723023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100556611511 + 100556611512.
It is an arithmetic number, because the mean of its divisors is an integer number (100556611512).
Almost surely, 2201113223023 is an apocalyptic number.
201113223023 is a deficient number, since it is larger than the sum of its proper divisors (1).
201113223023 is an equidigital number, since it uses as much as digits as its factorization.
201113223023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 201113223023 its reverse (320322311102), we get a palindrome (521435534125).
The spelling of 201113223023 in words is "two hundred one billion, one hundred thirteen million, two hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •