Base | Representation |
---|---|
bin | 11101010010000001001… |
… | …01110011101001101101 |
3 | 10120011221020221100210111 |
4 | 32221000211303221231 |
5 | 112441001113444411 |
6 | 2050110531140021 |
7 | 132455146616155 |
oct | 16510045635155 |
9 | 3504836840714 |
10 | 1006105999981 |
11 | 358761676075 |
12 | 142ba6a44611 |
13 | 73b4c2c9094 |
14 | 369a5369765 |
15 | 1b28783b721 |
hex | ea40973a6d |
1006105999981 has 2 divisors, whose sum is σ = 1006105999982. Its totient is φ = 1006105999980.
The previous prime is 1006105999957. The next prime is 1006106000027. The reversal of 1006105999981 is 1899995016001.
1006105999981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 978732297481 + 27373702500 = 989309^2 + 165450^2 .
It is a cyclic number.
It is not a de Polignac number, because 1006105999981 - 25 = 1006105999949 is a prime.
It is a super-2 number, since 2×10061059999812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1006105999901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 503052999990 + 503052999991.
It is an arithmetic number, because the mean of its divisors is an integer number (503052999991).
Almost surely, 21006105999981 is an apocalyptic number.
It is an amenable number.
1006105999981 is a deficient number, since it is larger than the sum of its proper divisors (1).
1006105999981 is an equidigital number, since it uses as much as digits as its factorization.
1006105999981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1574640, while the sum is 58.
The spelling of 1006105999981 in words is "one trillion, six billion, one hundred five million, nine hundred ninety-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •