Base | Representation |
---|---|
bin | 1001000110000100111111… |
… | …0001110001100101011111 |
3 | 1022101222210202012212221022 |
4 | 2101201033301301211133 |
5 | 2302320021203011221 |
6 | 33133540303154355 |
7 | 2051322606116552 |
oct | 221411761614537 |
9 | 38358722185838 |
10 | 10000022313311 |
11 | 3205a92994378 |
12 | 11560a32a59bb |
13 | 576cc896b874 |
14 | 26800a09a699 |
15 | 1251cbd9e4ab |
hex | 9184fc7195f |
10000022313311 has 2 divisors, whose sum is σ = 10000022313312. Its totient is φ = 10000022313310.
The previous prime is 10000022313277. The next prime is 10000022313329. The reversal of 10000022313311 is 11331322000001.
It is a strong prime.
It is an emirp because it is prime and its reverse (11331322000001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10000022313311 - 218 = 10000022051167 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10000022313311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000022313341) 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, 5000011156655 + 5000011156656.
It is an arithmetic number, because the mean of its divisors is an integer number (5000011156656).
Almost surely, 210000022313311 is an apocalyptic number.
10000022313311 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000022313311 is an equidigital number, since it uses as much as digits as its factorization.
10000022313311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10000022313311 its reverse (11331322000001), we get a palindrome (21331344313312).
The spelling of 10000022313311 in words is "ten trillion, twenty-two million, three hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •