Base | Representation |
---|---|
bin | 11110000001000001111110… |
… | …000101100111100110100000 |
3 | 122022102020122022011021120201 |
4 | 132001001332011213212200 |
5 | 114300342021413241000 |
6 | 1144433325322514544 |
7 | 36543366062251345 |
oct | 3601017605474640 |
9 | 568366568137521 |
10 | 132012230212000 |
11 | 39077088448336 |
12 | 12980a30965a54 |
13 | 5887913885998 |
14 | 24855d70747cc |
15 | 103de1b11c96a |
hex | 78107e1679a0 |
132012230212000 has 48 divisors (see below), whose sum is σ = 324354049640712. Its totient is φ = 52804892083200.
The previous prime is 132012230211971. The next prime is 132012230212001. The reversal of 132012230212000 is 212032210231.
It can be written as a sum of positive squares in 4 ways, for example, as 46584283271824 + 85427946940176 = 6825268^2 + 9242724^2 .
It is not an unprimeable number, because it can be changed into a prime (132012230212001) 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, 16501524777 + ... + 16501532776.
Almost surely, 2132012230212000 is an apocalyptic number.
132012230212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132012230212000 is an abundant number, since it is smaller than the sum of its proper divisors (192341819428712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132012230212000 is an equidigital number, since it uses as much as digits as its factorization.
132012230212000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33003057578 (or 33003057560 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 132012230212000 its reverse (212032210231), we get a palindrome (132224262422231).
The spelling of 132012230212000 in words is "one hundred thirty-two trillion, twelve billion, two hundred thirty million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •