Base | Representation |
---|---|
bin | 10100100000100001… |
… | …01010101111111011 |
3 | 1001102022200021200201 |
4 | 22100100222233323 |
5 | 140022104114344 |
6 | 5020311143031 |
7 | 536562231541 |
oct | 122020525773 |
9 | 31368607621 |
10 | 11010223099 |
11 | 473aa90637 |
12 | 2173374a77 |
13 | 1066096915 |
14 | 7663b1d91 |
15 | 44690d4d4 |
hex | 29042abfb |
11010223099 has 2 divisors, whose sum is σ = 11010223100. Its totient is φ = 11010223098.
The previous prime is 11010223061. The next prime is 11010223123. The reversal of 11010223099 is 99032201011.
11010223099 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (99032201011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11010223099 - 229 = 10473352187 is a prime.
It is not a weakly prime, because it can be changed into another prime (11010283099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505111549 + 5505111550.
It is an arithmetic number, because the mean of its divisors is an integer number (5505111550).
Almost surely, 211010223099 is an apocalyptic number.
11010223099 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010223099 is an equidigital number, since it uses as much as digits as its factorization.
11010223099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 28.
The spelling of 11010223099 in words is "eleven billion, ten million, two hundred twenty-three thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •