Base | Representation |
---|---|
bin | 1011111011000110101011… |
… | …1000010101101001011110 |
3 | 1201102022021202122101221020 |
4 | 2332301222320111221132 |
5 | 3204243322013403042 |
6 | 43514355520545010 |
7 | 2522111563514112 |
oct | 276615270255136 |
9 | 51368252571836 |
10 | 13110033341022 |
11 | 41a4a30052472 |
12 | 157898b782166 |
13 | 74136a059c27 |
14 | 334759807742 |
15 | 17b04e6683ec |
hex | bec6ae15a5e |
13110033341022 has 8 divisors (see below), whose sum is σ = 26220066682056. Its totient is φ = 4370011113672.
The previous prime is 13110033341017. The next prime is 13110033341023. The reversal of 13110033341022 is 22014333001131.
It is a sphenic number, since it is the product of 3 distinct primes.
13110033341022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 13110033340983 and 13110033341001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110033341023) 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, 1092502778413 + ... + 1092502778424.
It is an arithmetic number, because the mean of its divisors is an integer number (3277508335257).
Almost surely, 213110033341022 is an apocalyptic number.
13110033341022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13110033341022 is a wasteful number, since it uses less digits than its factorization.
13110033341022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2185005556842.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 13110033341022 its reverse (22014333001131), we get a palindrome (35124366342153).
The spelling of 13110033341022 in words is "thirteen trillion, one hundred ten billion, thirty-three million, three hundred forty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •