Base | Representation |
---|---|
bin | 101101101101000110000110… |
… | …100100000100101001011111 |
3 | 222100201110120201221021112021 |
4 | 231231012012210010221133 |
5 | 202321331033114221023 |
6 | 1551303104432121011 |
7 | 60224365340603254 |
oct | 5555060644045137 |
9 | 870643521837467 |
10 | 201011022023263 |
11 | 59059328649481 |
12 | 1a665348696167 |
13 | 8821347bc337a |
14 | 378cdb1c3142b |
15 | 1838b5829535d |
hex | b6d186904a5f |
201011022023263 has 2 divisors, whose sum is σ = 201011022023264. Its totient is φ = 201011022023262.
The previous prime is 201011022023221. The next prime is 201011022023269. The reversal of 201011022023263 is 362320220110102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201011022023263 - 29 = 201011022022751 is a prime.
It is a super-2 number, since 2×2010110220232632 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201011022023269) 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, 100505511011631 + 100505511011632.
It is an arithmetic number, because the mean of its divisors is an integer number (100505511011632).
Almost surely, 2201011022023263 is an apocalyptic number.
201011022023263 is a deficient number, since it is larger than the sum of its proper divisors (1).
201011022023263 is an equidigital number, since it uses as much as digits as its factorization.
201011022023263 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 201011022023263 its reverse (362320220110102), we get a palindrome (563331242133365).
The spelling of 201011022023263 in words is "two hundred one trillion, eleven billion, twenty-two million, twenty-three thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •