Base | Representation |
---|---|
bin | 10110111101110000101101… |
… | …010111101010110010000001 |
3 | 111020121121210010112121211211 |
4 | 112331300231113222302001 |
5 | 101214300440300041001 |
6 | 554451152153010121 |
7 | 30163045122523435 |
oct | 2675605527526201 |
9 | 436547703477754 |
10 | 101001212112001 |
11 | 2a200412160823 |
12 | b3b28656b3941 |
13 | 44484b1586c06 |
14 | 1ad26b021c9c5 |
15 | ba2417665351 |
hex | 5bdc2d5eac81 |
101001212112001 has 2 divisors, whose sum is σ = 101001212112002. Its totient is φ = 101001212112000.
The previous prime is 101001212111959. The next prime is 101001212112011. The reversal of 101001212112001 is 100211212100101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61148505702001 + 39852706410000 = 7819751^2 + 6312900^2 .
It is an emirp because it is prime and its reverse (100211212100101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101001212112001 - 219 = 101001211587713 is a prime.
It is not a weakly prime, because it can be changed into another prime (101001212112011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500606056000 + 50500606056001.
It is an arithmetic number, because the mean of its divisors is an integer number (50500606056001).
Almost surely, 2101001212112001 is an apocalyptic number.
It is an amenable number.
101001212112001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101001212112001 is an equidigital number, since it uses as much as digits as its factorization.
101001212112001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101001212112001 its reverse (100211212100101), we get a palindrome (201212424212102).
The spelling of 101001212112001 in words is "one hundred one trillion, one billion, two hundred twelve million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •