Base | Representation |
---|---|
bin | 1100000111010101010100… |
… | …0001110000111110100100 |
3 | 1202011101120001222002121100 |
4 | 3001311111001300332210 |
5 | 3221214101222023022 |
6 | 44155102333320100 |
7 | 2543226664553601 |
oct | 301652501607644 |
9 | 52141501862540 |
10 | 13320120111012 |
11 | 4276038603210 |
12 | 15b1641336030 |
13 | 75810b027250 |
14 | 3409a93976a8 |
15 | 1817483da1ac |
hex | c1d55070fa4 |
13320120111012 has 144 divisors (see below), whose sum is σ = 39906781544448. Its totient is φ = 3692934927360.
The previous prime is 13320120111007. The next prime is 13320120111019. The reversal of 13320120111012 is 21011102102331.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (13320120111019) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10867108 + ... + 12030555.
It is an arithmetic number, because the mean of its divisors is an integer number (277130427392).
Almost surely, 213320120111012 is an apocalyptic number.
13320120111012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13320120111012 is an abundant number, since it is smaller than the sum of its proper divisors (26586661433436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13320120111012 is a wasteful number, since it uses less digits than its factorization.
13320120111012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22897810 (or 22897805 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 13320120111012 its reverse (21011102102331), we get a palindrome (34331222213343).
The spelling of 13320120111012 in words is "thirteen trillion, three hundred twenty billion, one hundred twenty million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •