Base | Representation |
---|---|
bin | 1100000110110000010111… |
… | …1011000100101100100000 |
3 | 1202010102221221012210010110 |
4 | 3001230011323010230200 |
5 | 3221033243433201422 |
6 | 44150342311531320 |
7 | 2542426144651143 |
oct | 301540573045440 |
9 | 52112857183113 |
10 | 13310203022112 |
11 | 4271909678577 |
12 | 15ab734089b40 |
13 | 7571ba5791c9 |
14 | 34030825805a |
15 | 18136795860c |
hex | c1b05ec4b20 |
13310203022112 has 48 divisors (see below), whose sum is σ = 34940258896032. Its totient is φ = 4436610408960.
The previous prime is 13310203022111. The next prime is 13310203022143. The reversal of 13310203022112 is 21122030201331.
It is a tau number, because it is divible by the number of its divisors (48).
It is not an unprimeable number, because it can be changed into a prime (13310203022111) 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, 1550787 + ... + 5387517.
It is an arithmetic number, because the mean of its divisors is an integer number (727922060334).
Almost surely, 213310203022112 is an apocalyptic number.
13310203022112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13310203022112 is an abundant number, since it is smaller than the sum of its proper divisors (21630055873920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13310203022112 is a wasteful number, since it uses less digits than its factorization.
13310203022112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3872881 (or 3872873 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13310203022112 its reverse (21122030201331), we get a palindrome (34432233223443).
The spelling of 13310203022112 in words is "thirteen trillion, three hundred ten billion, two hundred three million, twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •