Base | Representation |
---|---|
bin | 11000011001111000… |
… | …01101001011110010 |
3 | 1020211002202010102012 |
4 | 30030330031023302 |
5 | 203313103323442 |
6 | 10004033322522 |
7 | 642452154104 |
oct | 141474151362 |
9 | 36732663365 |
10 | 13102011122 |
11 | 561381a972 |
12 | 2657a06442 |
13 | 130a56aa05 |
14 | 8c4121574 |
15 | 51a3a2582 |
hex | 30cf0d2f2 |
13102011122 has 4 divisors (see below), whose sum is σ = 19653016686. Its totient is φ = 6551005560.
The previous prime is 13102011103. The next prime is 13102011137. The reversal of 13102011122 is 22111020131.
13102011122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 22111020131 = 17 ⋅1300648243.
It can be written as a sum of positive squares in only one way, i.e., 11109370801 + 1992640321 = 105401^2 + 44639^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13102011097 and 13102011106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3275502779 + ... + 3275502782.
Almost surely, 213102011122 is an apocalyptic number.
13102011122 is a deficient number, since it is larger than the sum of its proper divisors (6551005564).
13102011122 is an equidigital number, since it uses as much as digits as its factorization.
13102011122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6551005563.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 13102011122 its reverse (22111020131), we get a palindrome (35213031253).
Subtracting 13102011122 from its reverse (22111020131), we obtain a palindrome (9009009009).
The spelling of 13102011122 in words is "thirteen billion, one hundred two million, eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •