Base | Representation |
---|---|
bin | 1011111010100101100001… |
… | …0100110101110100010010 |
3 | 1201101110022102102002000202 |
4 | 2332221120110311310102 |
5 | 3204122104310023442 |
6 | 43510324344415202 |
7 | 2521345160353406 |
oct | 276513024656422 |
9 | 51343272362022 |
10 | 13101132111122 |
11 | 41a1182592720 |
12 | 1577106777502 |
13 | 74057bbac6a3 |
14 | 334153583106 |
15 | 17abcce9bc32 |
hex | bea58535d12 |
13101132111122 has 64 divisors (see below), whose sum is σ = 24190176006144. Its totient is φ = 5247011447040.
The previous prime is 13101132111121. The next prime is 13101132111157. The reversal of 13101132111122 is 22111123110131.
13101132111122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 13101132111094 and 13101132111103.
It is not an unprimeable number, because it can be changed into a prime (13101132111121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15798188 + ... + 16606775.
It is an arithmetic number, because the mean of its divisors is an integer number (377971500096).
Almost surely, 213101132111122 is an apocalyptic number.
13101132111122 is a deficient number, since it is larger than the sum of its proper divisors (11089043895022).
13101132111122 is a wasteful number, since it uses less digits than its factorization.
13101132111122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32405063.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 13101132111122 its reverse (22111123110131), we get a palindrome (35212255221253).
Subtracting 13101132111122 from its reverse (22111123110131), we obtain a palindrome (9009990999009).
The spelling of 13101132111122 in words is "thirteen trillion, one hundred one billion, one hundred thirty-two million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •