Base | Representation |
---|---|
bin | 11110000011111101001111… |
… | …100000111111111010001011 |
3 | 122100010110200001121220121010 |
4 | 132003331033200333322023 |
5 | 114312140330423320321 |
6 | 1145105542430215003 |
7 | 36564045063064500 |
oct | 3603751740777213 |
9 | 570113601556533 |
10 | 132213312323211 |
11 | 39144395015719 |
12 | 129b39aa954463 |
13 | 58a087b131342 |
14 | 2491230b594a7 |
15 | 1044289592676 |
hex | 783f4f83fe8b |
132213312323211 has 12 divisors (see below), whose sum is σ = 205065545644392. Its totient is φ = 75550464184608.
The previous prime is 132213312323143. The next prime is 132213312323231. The reversal of 132213312323211 is 112323213312231.
It is a happy number.
It is not a de Polignac number, because 132213312323211 - 27 = 132213312323083 is a prime.
It is not an unprimeable number, because it can be changed into a prime (132213312323231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 449705143810 + ... + 449705144103.
It is an arithmetic number, because the mean of its divisors is an integer number (17088795470366).
Almost surely, 2132213312323211 is an apocalyptic number.
132213312323211 is a deficient number, since it is larger than the sum of its proper divisors (72852233321181).
132213312323211 is an equidigital number, since it uses as much as digits as its factorization.
132213312323211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 899410287930 (or 899410287923 counting only the distinct ones).
The product of its digits is 7776, while the sum is 30.
Adding to 132213312323211 its reverse (112323213312231), we get a palindrome (244536525635442).
The spelling of 132213312323211 in words is "one hundred thirty-two trillion, two hundred thirteen billion, three hundred twelve million, three hundred twenty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •