Base | Representation |
---|---|
bin | 1001111011000011010000… |
… | …0110101100011100111011 |
3 | 1102121222212000012102122122 |
4 | 2132300310012230130323 |
5 | 2412222331310231021 |
6 | 35112005431511455 |
7 | 2204141141152313 |
oct | 236606406543473 |
9 | 42558760172578 |
10 | 10910091102011 |
11 | 3526a42002142 |
12 | 128254752858b |
13 | 611a8144b4ba |
14 | 29a0a07d0443 |
15 | 13dbe3325bab |
hex | 9ec341ac73b |
10910091102011 has 2 divisors, whose sum is σ = 10910091102012. Its totient is φ = 10910091102010.
The previous prime is 10910091101863. The next prime is 10910091102041. The reversal of 10910091102011 is 11020119001901.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10910091102011 - 238 = 10635213195067 is a prime.
It is not a weakly prime, because it can be changed into another prime (10910091102041) 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, 5455045551005 + 5455045551006.
It is an arithmetic number, because the mean of its divisors is an integer number (5455045551006).
Almost surely, 210910091102011 is an apocalyptic number.
10910091102011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10910091102011 is an equidigital number, since it uses as much as digits as its factorization.
10910091102011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 26.
The spelling of 10910091102011 in words is "ten trillion, nine hundred ten billion, ninety-one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •