Base | Representation |
---|---|
bin | 11110000010010011101110… |
… | …010010100100111011010111 |
3 | 122022201122012222002022001022 |
4 | 132002103232102210323113 |
5 | 114303311311033044111 |
6 | 1144541524023151355 |
7 | 36552624305206352 |
oct | 3602235622447327 |
9 | 568648188068038 |
10 | 132100012003031 |
11 | 39100333a32176 |
12 | 12995a4a8a555b |
13 | 5892c92c6c477 |
14 | 2489963515299 |
15 | 10413578822db |
hex | 7824ee4a4ed7 |
132100012003031 has 8 divisors (see below), whose sum is σ = 132464147884800. Its totient is φ = 131735898895608.
The previous prime is 132100012003027. The next prime is 132100012003081. The reversal of 132100012003031 is 130300210001231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132100012003031 - 22 = 132100012003027 is a prime.
It is a super-2 number, since 2×1321000120030312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132100012003081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5955980 + ... + 17311086.
It is an arithmetic number, because the mean of its divisors is an integer number (16558018485600).
Almost surely, 2132100012003031 is an apocalyptic number.
132100012003031 is a deficient number, since it is larger than the sum of its proper divisors (364135881769).
132100012003031 is a wasteful number, since it uses less digits than its factorization.
132100012003031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11387173.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 132100012003031 its reverse (130300210001231), we get a palindrome (262400222004262).
The spelling of 132100012003031 in words is "one hundred thirty-two trillion, one hundred billion, twelve million, three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •