Base | Representation |
---|---|
bin | 10110111101110000101101… |
… | …010100001100011001001001 |
3 | 111020121121210001211100022122 |
4 | 112331300231110030121021 |
5 | 101214300440031413342 |
6 | 554451152121301025 |
7 | 30163045112010644 |
oct | 2675605524143111 |
9 | 436547701740278 |
10 | 101001211201097 |
11 | 2a200411699409 |
12 | b3b2865334775 |
13 | 44484b132840c |
14 | 1ad26b0062a5b |
15 | ba24175354d2 |
hex | 5bdc2d50c649 |
101001211201097 has 2 divisors, whose sum is σ = 101001211201098. Its totient is φ = 101001211201096.
The previous prime is 101001211201069. The next prime is 101001211201133. The reversal of 101001211201097 is 790102112100101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72710769297721 + 28290441903376 = 8527061^2 + 5318876^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101001211201097 is a prime.
It is not a weakly prime, because it can be changed into another prime (101001211209097) 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, 50500605600548 + 50500605600549.
It is an arithmetic number, because the mean of its divisors is an integer number (50500605600549).
Almost surely, 2101001211201097 is an apocalyptic number.
It is an amenable number.
101001211201097 is a deficient number, since it is larger than the sum of its proper divisors (1).
101001211201097 is an equidigital number, since it uses as much as digits as its factorization.
101001211201097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 26.
Adding to 101001211201097 its reverse (790102112100101), we get a palindrome (891103323301198).
The spelling of 101001211201097 in words is "one hundred one trillion, one billion, two hundred eleven million, two hundred one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •