Base | Representation |
---|---|
bin | 101111001000101001… |
… | …1110010010101000101 |
3 | 100200021100022000211022 |
4 | 1132101103302111011 |
5 | 3124300331143023 |
6 | 114300101320525 |
7 | 10212243626453 |
oct | 1362123622505 |
9 | 320240260738 |
10 | 101222131013 |
11 | 39a23288233 |
12 | 1774b106145 |
13 | 9711a822a3 |
14 | 4c834b19d3 |
15 | 29766977c8 |
hex | 17914f2545 |
101222131013 has 4 divisors (see below), whose sum is σ = 101994819168. Its totient is φ = 100449442860.
The previous prime is 101222130959. The next prime is 101222131091. The reversal of 101222131013 is 310131222101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101222131013 - 212 = 101222126917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101222130982 and 101222131000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101222131093) 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, 386343881 + ... + 386344142.
It is an arithmetic number, because the mean of its divisors is an integer number (25498704792).
Almost surely, 2101222131013 is an apocalyptic number.
It is an amenable number.
101222131013 is a deficient number, since it is larger than the sum of its proper divisors (772688155).
101222131013 is an equidigital number, since it uses as much as digits as its factorization.
101222131013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 772688154.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 101222131013 its reverse (310131222101), we get a palindrome (411353353114).
The spelling of 101222131013 in words is "one hundred one billion, two hundred twenty-two million, one hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •