Base | Representation |
---|---|
bin | 11110000101100010101010… |
… | …100001010000011100100010 |
3 | 122100111212202120000201112220 |
4 | 132011202222201100130202 |
5 | 114320431343101100002 |
6 | 1145231552520131510 |
7 | 36604651541110605 |
oct | 3605425241203442 |
9 | 570455676021486 |
10 | 132322213300002 |
11 | 39186598858390 |
12 | 12a10b21606b96 |
13 | 58aac14a3004b |
14 | 2496601db633c |
15 | 104700ee487bc |
hex | 7858aa850722 |
132322213300002 has 32 divisors (see below), whose sum is σ = 291679330549824. Its totient is φ = 39684262656000.
The previous prime is 132322213299923. The next prime is 132322213300003. The reversal of 132322213300002 is 200003312223231.
It is a super-2 number, since 2×1323222133000022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (132322213300003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10334436999 + ... + 10334449802.
It is an arithmetic number, because the mean of its divisors is an integer number (9114979079682).
Almost surely, 2132322213300002 is an apocalyptic number.
132322213300002 is an abundant number, since it is smaller than the sum of its proper divisors (159357117249822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132322213300002 is a wasteful number, since it uses less digits than its factorization.
132322213300002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20668886914.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 132322213300002 its reverse (200003312223231), we get a palindrome (332325525523233).
The spelling of 132322213300002 in words is "one hundred thirty-two trillion, three hundred twenty-two billion, two hundred thirteen million, three hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •