Base | Representation |
---|---|
bin | 10110111111010111111000… |
… | …110110101100010111011001 |
3 | 111021000012202010212201201211 |
4 | 112333113320312230113121 |
5 | 101223104334022432301 |
6 | 555014113414143121 |
7 | 30204046423665112 |
oct | 2677277066542731 |
9 | 437005663781654 |
10 | 101112000202201 |
11 | 2a2433a414774a |
12 | b410224351aa1 |
13 | 4455a89126a81 |
14 | 1ad7bbdd4b209 |
15 | ba524da31051 |
hex | 5bf5f8dac5d9 |
101112000202201 has 2 divisors, whose sum is σ = 101112000202202. Its totient is φ = 101112000202200.
The previous prime is 101112000202123. The next prime is 101112000202261. The reversal of 101112000202201 is 102202000211101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100613959483801 + 498040718400 = 10030651^2 + 705720^2 .
It is a cyclic number.
It is not a de Polignac number, because 101112000202201 - 217 = 101112000071129 is a prime.
It is a super-3 number, since 3×1011120002022013 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (101112000202261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556000101100 + 50556000101101.
It is an arithmetic number, because the mean of its divisors is an integer number (50556000101101).
Almost surely, 2101112000202201 is an apocalyptic number.
It is an amenable number.
101112000202201 is a deficient number, since it is larger than the sum of its proper divisors (1).
101112000202201 is an equidigital number, since it uses as much as digits as its factorization.
101112000202201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101112000202201 its reverse (102202000211101), we get a palindrome (203314000413302).
The spelling of 101112000202201 in words is "one hundred one trillion, one hundred twelve billion, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •