Base | Representation |
---|---|
bin | 1001000110101010001100… |
… | …1010000000110001101111 |
3 | 1022102221120212220100201011 |
4 | 2101222203022000301233 |
5 | 2303001000321014021 |
6 | 33142311405530051 |
7 | 2052125256362356 |
oct | 221524312006157 |
9 | 38387525810634 |
10 | 10010011110511 |
11 | 320a249347575 |
12 | 1158010573927 |
13 | 577c2b235b59 |
14 | 2686b694499d |
15 | 1255b3c97de1 |
hex | 91aa3280c6f |
10010011110511 has 2 divisors, whose sum is σ = 10010011110512. Its totient is φ = 10010011110510.
The previous prime is 10010011110493. The next prime is 10010011110523. The reversal of 10010011110511 is 11501111001001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10010011110511 - 221 = 10010009013359 is a prime.
It is a super-2 number, since 2×100100111105112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10010011110491 and 10010011110500.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10010011110571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005005555255 + 5005005555256.
It is an arithmetic number, because the mean of its divisors is an integer number (5005005555256).
Almost surely, 210010011110511 is an apocalyptic number.
10010011110511 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010011110511 is an equidigital number, since it uses as much as digits as its factorization.
10010011110511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5, while the sum is 13.
Adding to 10010011110511 its reverse (11501111001001), we get a palindrome (21511122111512).
The spelling of 10010011110511 in words is "ten trillion, ten billion, eleven million, one hundred ten thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •