Base | Representation |
---|---|
bin | 111101111000100010… |
… | …1010100011101000000 |
3 | 110201000120222120112201 |
4 | 1323301011110131000 |
5 | 4134131243104212 |
6 | 141014525402544 |
7 | 12413142000622 |
oct | 1736105243500 |
9 | 421016876481 |
10 | 132893722432 |
11 | 513a6050679 |
12 | 21909a09454 |
13 | c6bb558123 |
14 | 6609928c12 |
15 | 36cbe12b57 |
hex | 1ef1154740 |
132893722432 has 42 divisors (see below), whose sum is σ = 272492325474. Its totient is φ = 64303384320.
The previous prime is 132893722411. The next prime is 132893722453. The reversal of 132893722432 is 234227398231.
132893722432 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (132893722411) and next prime (132893722453).
It can be written as a sum of positive squares in only one way, i.e., 130742989056 + 2150733376 = 361584^2 + 46376^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1018863 + ... + 1141870.
Almost surely, 2132893722432 is an apocalyptic number.
It is an amenable number.
132893722432 is an abundant number, since it is smaller than the sum of its proper divisors (139598603042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132893722432 is an equidigital number, since it uses as much as digits as its factorization.
132893722432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2160807 (or 2160766 counting only the distinct ones).
The product of its digits is 870912, while the sum is 46.
The spelling of 132893722432 in words is "one hundred thirty-two billion, eight hundred ninety-three million, seven hundred twenty-two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •