Base | Representation |
---|---|
bin | 1011111010101001100010… |
… | …1100110000100111101000 |
3 | 1201101120002200122100221211 |
4 | 2332222120230300213220 |
5 | 3204131312300414422 |
6 | 43511023445042504 |
7 | 2521414013330410 |
oct | 276523054604750 |
9 | 51346080570854 |
10 | 13102212123112 |
11 | 41a1687195712 |
12 | 15773683b6434 |
13 | 7406c1882538 |
14 | 334216b9b640 |
15 | 17ac42bd5577 |
hex | bea98b309e8 |
13102212123112 has 32 divisors (see below), whose sum is σ = 28077445411200. Its totient is φ = 5614978451904.
The previous prime is 13102212123083. The next prime is 13102212123113. The reversal of 13102212123112 is 21132121220131.
It is a happy number.
13102212123112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (13102212123113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4073863 + ... + 6542230.
It is an arithmetic number, because the mean of its divisors is an integer number (877420169100).
Almost surely, 213102212123112 is an apocalyptic number.
It is an amenable number.
13102212123112 is an abundant number, since it is smaller than the sum of its proper divisors (14975233288088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13102212123112 is a wasteful number, since it uses less digits than its factorization.
13102212123112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10638145 (or 10638141 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 13102212123112 its reverse (21132121220131), we get a palindrome (34234333343243).
The spelling of 13102212123112 in words is "thirteen trillion, one hundred two billion, two hundred twelve million, one hundred twenty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •