Base | Representation |
---|---|
bin | 10000001100100100101… |
… | …001001010101010011011 |
3 | 10221101212200010100021111 |
4 | 100030210221022222123 |
5 | 121213421343113034 |
6 | 2211151010521151 |
7 | 143261312650522 |
oct | 20144451125233 |
9 | 3841780110244 |
10 | 1113011301019 |
11 | 39a030955032 |
12 | 15b8612961b7 |
13 | 80c58605a67 |
14 | 3bc275354b9 |
15 | 1de42dd6364 |
hex | 10324a4aa9b |
1113011301019 has 2 divisors, whose sum is σ = 1113011301020. Its totient is φ = 1113011301018.
The previous prime is 1113011301001. The next prime is 1113011301029. The reversal of 1113011301019 is 9101031103111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1113011301019 - 215 = 1113011268251 is a prime.
It is a super-2 number, since 2×11130113010192 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1113011301029) 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, 556505650509 + 556505650510.
It is an arithmetic number, because the mean of its divisors is an integer number (556505650510).
Almost surely, 21113011301019 is an apocalyptic number.
1113011301019 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113011301019 is an equidigital number, since it uses as much as digits as its factorization.
1113011301019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 22.
The spelling of 1113011301019 in words is "one trillion, one hundred thirteen billion, eleven million, three hundred one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •