Base | Representation |
---|---|
bin | 11110000000111000101001… |
… | …000001011111101011001011 |
3 | 122022101021210012020221110220 |
4 | 132000320221001133223023 |
5 | 114300211013030224003 |
6 | 1144424551330041123 |
7 | 36542562616424403 |
oct | 3600705101375313 |
9 | 568337705227426 |
10 | 132002213133003 |
11 | 39072908028654 |
12 | 1297aab61191a3 |
13 | 58869a84987c5 |
14 | 2484d26947803 |
15 | 103da319d9353 |
hex | 780e2905facb |
132002213133003 has 32 divisors (see below), whose sum is σ = 186759249431040. Its totient is φ = 82700486991360.
The previous prime is 132002213132971. The next prime is 132002213133017. The reversal of 132002213133003 is 300331312200231.
It is not a de Polignac number, because 132002213133003 - 25 = 132002213132971 is a prime.
It is a super-3 number, since 3×1320022131330033 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (132002213133073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13657183 + ... + 21225528.
It is an arithmetic number, because the mean of its divisors is an integer number (5836226544720).
Almost surely, 2132002213133003 is an apocalyptic number.
132002213133003 is a deficient number, since it is larger than the sum of its proper divisors (54757036298037).
132002213133003 is a wasteful number, since it uses less digits than its factorization.
132002213133003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34883267.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 132002213133003 its reverse (300331312200231), we get a palindrome (432333525333234).
The spelling of 132002213133003 in words is "one hundred thirty-two trillion, two billion, two hundred thirteen million, one hundred thirty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •