Base | Representation |
---|---|
bin | 10000000000011110010… |
… | …010101111111001111011 |
3 | 10220011100021102201020202 |
4 | 100000132102233321323 |
5 | 121010320040442232 |
6 | 2201201523112415 |
7 | 142321342345463 |
oct | 20003622577173 |
9 | 3804307381222 |
10 | 1100019859067 |
11 | 394574595448 |
12 | 15923651270b |
13 | 7c967c3c4bc |
14 | 3b353d96ba3 |
15 | 1d9325c5162 |
hex | 1001e4afe7b |
1100019859067 has 2 divisors, whose sum is σ = 1100019859068. Its totient is φ = 1100019859066.
The previous prime is 1100019859051. The next prime is 1100019859087. The reversal of 1100019859067 is 7609589100011.
It is a weak prime.
It is an emirp because it is prime and its reverse (7609589100011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1100019859067 - 24 = 1100019859051 is a prime.
It is a super-2 number, since 2×11000198590672 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1100019859087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550009929533 + 550009929534.
It is an arithmetic number, because the mean of its divisors is an integer number (550009929534).
Almost surely, 21100019859067 is an apocalyptic number.
1100019859067 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100019859067 is an equidigital number, since it uses as much as digits as its factorization.
1100019859067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 136080, while the sum is 47.
The spelling of 1100019859067 in words is "one trillion, one hundred billion, nineteen million, eight hundred fifty-nine thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •