Base | Representation |
---|---|
bin | 1011111011000110111110… |
… | …0100100001011000101111 |
3 | 1201102022111020201100002010 |
4 | 2332301233210201120233 |
5 | 3204244002140013203 |
6 | 43514411411332303 |
7 | 2522113540416546 |
oct | 276615744413057 |
9 | 51368436640063 |
10 | 13110112032303 |
11 | 41a4a7050a390 |
12 | 15789b1bb1093 |
13 | 74138044c710 |
14 | 33476604d15d |
15 | 17b05650e303 |
hex | bec6f92162f |
13110112032303 has 64 divisors (see below), whose sum is σ = 21623747443200. Its totient is φ = 6946132008960.
The previous prime is 13110112032217. The next prime is 13110112032377. The reversal of 13110112032303 is 30323021101131.
It is a happy number.
It is not a de Polignac number, because 13110112032303 - 221 = 13110109935151 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13110112032303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110112032403) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 25905951 + ... + 26407167.
It is an arithmetic number, because the mean of its divisors is an integer number (337871053800).
Almost surely, 213110112032303 is an apocalyptic number.
13110112032303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13110112032303 is a deficient number, since it is larger than the sum of its proper divisors (8513635410897).
13110112032303 is a wasteful number, since it uses less digits than its factorization.
13110112032303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504472.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 13110112032303 its reverse (30323021101131), we get a palindrome (43433133133434).
The spelling of 13110112032303 in words is "thirteen trillion, one hundred ten billion, one hundred twelve million, thirty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •