Base | Representation |
---|---|
bin | 11110000000110110100111… |
… | …000001001010111100101111 |
3 | 122022101002011012002102020121 |
4 | 132000312213001022330233 |
5 | 114300142031143310111 |
6 | 1144423551053025411 |
7 | 36542454563246323 |
oct | 3600664701127457 |
9 | 568332135072217 |
10 | 132000032010031 |
11 | 39071998921689 |
12 | 1297a5a7785267 |
13 | 588671b6463b3 |
14 | 2484b9adc1983 |
15 | 103d95529a871 |
hex | 780da704af2f |
132000032010031 has 32 divisors (see below), whose sum is σ = 136662733440000. Its totient is φ = 127446940000512.
The previous prime is 132000032010023. The next prime is 132000032010127. The reversal of 132000032010031 is 130010230000231.
It is not a de Polignac number, because 132000032010031 - 23 = 132000032010023 is a prime.
It is a super-2 number, since 2×1320000320100312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132000032009987 and 132000032010014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132000032010001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 318998590 + ... + 319412116.
It is an arithmetic number, because the mean of its divisors is an integer number (4270710420000).
Almost surely, 2132000032010031 is an apocalyptic number.
132000032010031 is a deficient number, since it is larger than the sum of its proper divisors (4662701429969).
132000032010031 is a wasteful number, since it uses less digits than its factorization.
132000032010031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 414151.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 132000032010031 its reverse (130010230000231), we get a palindrome (262010262010262).
The spelling of 132000032010031 in words is "one hundred thirty-two trillion, thirty-two million, ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •