Base | Representation |
---|---|
bin | 1100000111010101101001… |
… | …1110001000001010110000 |
3 | 1202011101210102210200121022 |
4 | 3001311122132020022300 |
5 | 3221214243111311422 |
6 | 44155115354515012 |
7 | 2543232154021064 |
oct | 301653236101260 |
9 | 52141712720538 |
10 | 13320211432112 |
11 | 42760851070a2 |
12 | 15b1667a35a68 |
13 | 758123c1c5c0 |
14 | 3409b7569aa4 |
15 | 181751428342 |
hex | c1d5a7882b0 |
13320211432112 has 40 divisors (see below), whose sum is σ = 27794015652480. Its totient is φ = 6147594754560.
The previous prime is 13320211432111. The next prime is 13320211432127. The reversal of 13320211432112 is 21123411202331.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is not an unprimeable number, because it can be changed into a prime (13320211432111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5657537 + ... + 7658207.
It is an arithmetic number, because the mean of its divisors is an integer number (694850391312).
Almost surely, 213320211432112 is an apocalyptic number.
It is an amenable number.
13320211432112 is an abundant number, since it is smaller than the sum of its proper divisors (14473804220368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13320211432112 is a wasteful number, since it uses less digits than its factorization.
13320211432112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2032701 (or 2032695 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 13320211432112 its reverse (21123411202331), we get a palindrome (34443622634443).
The spelling of 13320211432112 in words is "thirteen trillion, three hundred twenty billion, two hundred eleven million, four hundred thirty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •