Base | Representation |
---|---|
bin | 10110111111010111111000… |
… | …111001110000111001110101 |
3 | 111021000012202012101122000101 |
4 | 112333113320321300321311 |
5 | 101223104334224212341 |
6 | 555014113443314101 |
7 | 30204046433560111 |
oct | 2677277071607165 |
9 | 437005665348011 |
10 | 101112001007221 |
11 | 2a2433a4647556 |
12 | b41022467b931 |
13 | 4455a89349309 |
14 | 1ad7bc00ba741 |
15 | ba524db3e831 |
hex | 5bf5f8e70e75 |
101112001007221 has 2 divisors, whose sum is σ = 101112001007222. Its totient is φ = 101112001007220.
The previous prime is 101112001007219. The next prime is 101112001007231. The reversal of 101112001007221 is 122700100211101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69831593640900 + 31280407366321 = 8356530^2 + 5592889^2 .
It is a cyclic number.
It is not a de Polignac number, because 101112001007221 - 21 = 101112001007219 is a prime.
Together with 101112001007219, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101112001007231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556000503610 + 50556000503611.
It is an arithmetic number, because the mean of its divisors is an integer number (50556000503611).
Almost surely, 2101112001007221 is an apocalyptic number.
It is an amenable number.
101112001007221 is a deficient number, since it is larger than the sum of its proper divisors (1).
101112001007221 is an equidigital number, since it uses as much as digits as its factorization.
101112001007221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 101112001007221 its reverse (122700100211101), we get a palindrome (223812101218322).
The spelling of 101112001007221 in words is "one hundred one trillion, one hundred twelve billion, one million, seven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •