Base | Representation |
---|---|
bin | 1001000110000100111111… |
… | …0000100111110011011011 |
3 | 1022101222210201122112101021 |
4 | 2101201033300213303123 |
5 | 2302320021113323344 |
6 | 33133540252503311 |
7 | 2051322603420511 |
oct | 221411760476333 |
9 | 38358721575337 |
10 | 10000022011099 |
11 | 3205a927a830a |
12 | 11560a317ab37 |
13 | 576cc8894143 |
14 | 26800a01c4b1 |
15 | 1251cbd3eb84 |
hex | 9184fc27cdb |
10000022011099 has 2 divisors, whose sum is σ = 10000022011100. Its totient is φ = 10000022011098.
The previous prime is 10000022011097. The next prime is 10000022011193. The reversal of 10000022011099 is 99011022000001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10000022011099 - 21 = 10000022011097 is a prime.
Together with 10000022011097, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10000022011097) 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, 5000011005549 + 5000011005550.
It is an arithmetic number, because the mean of its divisors is an integer number (5000011005550).
Almost surely, 210000022011099 is an apocalyptic number.
10000022011099 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000022011099 is an equidigital number, since it uses as much as digits as its factorization.
10000022011099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 25.
The spelling of 10000022011099 in words is "ten trillion, twenty-two million, eleven thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •