Base | Representation |
---|---|
bin | 101111001000010100… |
… | …1101101011101001001 |
3 | 100200020120112122111100 |
4 | 1132100221231131021 |
5 | 3124240020213001 |
6 | 114255025052013 |
7 | 10212051110133 |
oct | 1362051553511 |
9 | 320216478440 |
10 | 101211101001 |
11 | 39a1803421a |
12 | 17747487009 |
13 | 970c6bc95a |
14 | 4c81c40053 |
15 | 2975719586 |
hex | 1790a6d749 |
101211101001 has 12 divisors (see below), whose sum is σ = 146269468228. Its totient is φ = 67439149344.
The previous prime is 101211100979. The next prime is 101211101011. The reversal of 101211101001 is 100101112101.
It can be written as a sum of positive squares in 2 ways, for example, as 33116720400 + 68094380601 = 181980^2 + 260949^2 .
It is not a de Polignac number, because 101211101001 - 219 = 101210576713 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101211101011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2891470 + ... + 2926263.
Almost surely, 2101211101001 is an apocalyptic number.
It is an amenable number.
101211101001 is a deficient number, since it is larger than the sum of its proper divisors (45058367227).
101211101001 is a wasteful number, since it uses less digits than its factorization.
101211101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5819672 (or 5819669 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101211101001 its reverse (100101112101), we get a palindrome (201312213102).
The spelling of 101211101001 in words is "one hundred one billion, two hundred eleven million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •