Base | Representation |
---|---|
bin | 10111000000111110010101… |
… | …011110010010011110011011 |
3 | 111021101201200100200112221211 |
4 | 113000332111132102132123 |
5 | 101231410130003310021 |
6 | 555140425030443551 |
7 | 30215022366635131 |
oct | 2700762536223633 |
9 | 437351610615854 |
10 | 101222002010011 |
11 | 2a286012312013 |
12 | b4296038035b7 |
13 | 4463269b0778c |
14 | 1add257481751 |
15 | ba803ad843e1 |
hex | 5c0f9579279b |
101222002010011 has 4 divisors (see below), whose sum is σ = 102647664010224. Its totient is φ = 99796340009800.
The previous prime is 101222002009993. The next prime is 101222002010027. The reversal of 101222002010011 is 110010200222101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101222002010011 - 219 = 101222001485723 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101222002009973 and 101222002010000.
It is not an unprimeable number, because it can be changed into a prime (101222002014011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 712831000000 + ... + 712831000141.
It is an arithmetic number, because the mean of its divisors is an integer number (25661916002556).
Almost surely, 2101222002010011 is an apocalyptic number.
101222002010011 is a deficient number, since it is larger than the sum of its proper divisors (1425662000213).
101222002010011 is an equidigital number, since it uses as much as digits as its factorization.
101222002010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1425662000212.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101222002010011 its reverse (110010200222101), we get a palindrome (211232202232112).
The spelling of 101222002010011 in words is "one hundred one trillion, two hundred twenty-two billion, two million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •