Base | Representation |
---|---|
bin | 11110000011111100010100… |
… | …011000000001000101101000 |
3 | 122100010101002220121102001210 |
4 | 132003330110120001011220 |
5 | 114312131312422104000 |
6 | 1145105300143513120 |
7 | 36564011354326401 |
oct | 3603742430010550 |
9 | 570111086542053 |
10 | 132212320113000 |
11 | 39143a25a32486 |
12 | 129b37725b87a0 |
13 | 58a07506c09ca |
14 | 24911790789a8 |
15 | 104422c3ee350 |
hex | 783f14601168 |
132212320113000 has 128 divisors (see below), whose sum is σ = 423651153669120. Its totient is φ = 34303737081600.
The previous prime is 132212320112987. The next prime is 132212320113011. The reversal of 132212320113000 is 311023212231.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 595439992 + ... + 595661991.
It is an arithmetic number, because the mean of its divisors is an integer number (3309774638040).
Almost surely, 2132212320113000 is an apocalyptic number.
132212320113000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132212320113000 is an abundant number, since it is smaller than the sum of its proper divisors (291438833556120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132212320113000 is a wasteful number, since it uses less digits than its factorization.
132212320113000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1191102044 (or 1191102030 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 132212320113000 its reverse (311023212231), we get a palindrome (132523343325231).
The spelling of 132212320113000 in words is "one hundred thirty-two trillion, two hundred twelve billion, three hundred twenty million, one hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •