Base | Representation |
---|---|
bin | 1001001001000001001111… |
… | …00001010110011111101111 |
3 | 2122011122110220202200002201 |
4 | 10210200213201112133233 |
5 | 10113314033124441344 |
6 | 110430153352202331 |
7 | 4143154146601546 |
oct | 444404741263757 |
9 | 78148426680081 |
10 | 20101109999599 |
11 | 644a918618282 |
12 | 23078910993a7 |
13 | b2a6aca65775 |
14 | 4d6c828a115d |
15 | 24cd2177e4d4 |
hex | 1248278567ef |
20101109999599 has 2 divisors, whose sum is σ = 20101109999600. Its totient is φ = 20101109999598.
The previous prime is 20101109999561. The next prime is 20101109999617. The reversal of 20101109999599 is 99599990110102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20101109999599 - 217 = 20101109868527 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20101109999599.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20101109999699) 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, 10050554999799 + 10050554999800.
It is an arithmetic number, because the mean of its divisors is an integer number (10050554999800).
Almost surely, 220101109999599 is an apocalyptic number.
20101109999599 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101109999599 is an equidigital number, since it uses as much as digits as its factorization.
20101109999599 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5314410, while the sum is 64.
The spelling of 20101109999599 in words is "twenty trillion, one hundred one billion, one hundred nine million, nine hundred ninety-nine thousand, five hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •