Base | Representation |
---|---|
bin | 111101100100010000… |
… | …0100100110001110011 |
3 | 110122021011002100202002 |
4 | 1323020200210301303 |
5 | 4131233012020311 |
6 | 140423211244215 |
7 | 12360234653165 |
oct | 1731040446163 |
9 | 418234070662 |
10 | 132213001331 |
11 | 51086879854 |
12 | 21759a4966b |
13 | c610508b88 |
14 | 658336c935 |
15 | 368c29c93b |
hex | 1ec8824c73 |
132213001331 has 4 divisors (see below), whose sum is σ = 132214572600. Its totient is φ = 132211430064.
The previous prime is 132213001289. The next prime is 132213001369. The reversal of 132213001331 is 133100312231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132213001331 - 26 = 132213001267 is a prime.
It is a super-3 number, since 3×1322130013313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132213001381) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 651821 + ... + 830238.
It is an arithmetic number, because the mean of its divisors is an integer number (33053643150).
Almost surely, 2132213001331 is an apocalyptic number.
132213001331 is a deficient number, since it is larger than the sum of its proper divisors (1571269).
132213001331 is an equidigital number, since it uses as much as digits as its factorization.
132213001331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1571268.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 132213001331 its reverse (133100312231), we get a palindrome (265313313562).
The spelling of 132213001331 in words is "one hundred thirty-two billion, two hundred thirteen million, one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •