Base | Representation |
---|---|
bin | 111101011110100100… |
… | …0000100111111011101 |
3 | 110121202211202000201222 |
4 | 1322331020010333131 |
5 | 4130340114432201 |
6 | 140352230143125 |
7 | 12352425512300 |
oct | 1727510047735 |
9 | 417684660658 |
10 | 132022030301 |
11 | 50a98aa3457 |
12 | 21705ab1aa5 |
13 | c5aca93475 |
14 | 6565c5ab37 |
15 | 367a62891b |
hex | 1ebd204fdd |
132022030301 has 12 divisors (see below), whose sum is σ = 158530734720. Its totient is φ = 109511360280.
The previous prime is 132022030289. The next prime is 132022030313. The reversal of 132022030301 is 103030220231.
It is an interprime number because it is at equal distance from previous prime (132022030289) and next prime (132022030313).
It is not a de Polignac number, because 132022030301 - 26 = 132022030237 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132022030301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132022030331) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 43455371 + ... + 43458408.
It is an arithmetic number, because the mean of its divisors is an integer number (13210894560).
Almost surely, 2132022030301 is an apocalyptic number.
It is an amenable number.
132022030301 is a deficient number, since it is larger than the sum of its proper divisors (26508704419).
132022030301 is an equidigital number, since it uses as much as digits as its factorization.
132022030301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86913824 (or 86913817 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 132022030301 its reverse (103030220231), we get a palindrome (235052250532).
The spelling of 132022030301 in words is "one hundred thirty-two billion, twenty-two million, thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •