Base | Representation |
---|---|
bin | 11110000011111010010111… |
… | …110011010100111001000000 |
3 | 122100010011201020220202122122 |
4 | 132003322113303110321000 |
5 | 114312113022402320000 |
6 | 1145104312524023412 |
7 | 36563605515561344 |
oct | 3603722763247100 |
9 | 570104636822578 |
10 | 132210230120000 |
11 | 3914305320983a |
12 | 129b328a691b68 |
13 | 58a04a96c7966 |
14 | 249101b675624 |
15 | 1044158bb2085 |
hex | 783e97cd4e40 |
132210230120000 has 140 divisors (see below), whose sum is σ = 347123016062460. Its totient is φ = 49773262848000.
The previous prime is 132210230119999. The next prime is 132210230120063. The reversal of 132210230120000 is 21032012231.
It can be written as a sum of positive squares in 10 ways, for example, as 107338385459776 + 24871844660224 = 10360424^2 + 4987168^2 .
It is a Harshad number since it is a multiple of its sum of digits (17).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 96533405 + ... + 97893404.
Almost surely, 2132210230120000 is an apocalyptic number.
132210230120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132210230120000 is an abundant number, since it is smaller than the sum of its proper divisors (214912785942460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132210230120000 is an equidigital number, since it uses as much as digits as its factorization.
132210230120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194426858 (or 194426833 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 132210230120000 its reverse (21032012231), we get a palindrome (132231262132231).
The spelling of 132210230120000 in words is "one hundred thirty-two trillion, two hundred ten billion, two hundred thirty million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •