Base | Representation |
---|---|
bin | 11101000110101101000… |
… | …11110000111000000011 |
3 | 10112121020221211220001020 |
4 | 32203112203300320003 |
5 | 112341031210042011 |
6 | 2043224114440523 |
7 | 132151504462263 |
oct | 16432643607003 |
9 | 3477227756036 |
10 | 1000032112131 |
11 | 356125069248 |
12 | 141990893143 |
13 | 733c1b2ccc0 |
14 | 3658a8057a3 |
15 | 1b02e4ab006 |
hex | e8d68f0e03 |
1000032112131 has 16 divisors (see below), whose sum is σ = 1438821216000. Its totient is φ = 614171089440.
The previous prime is 1000032112129. The next prime is 1000032112139. The reversal of 1000032112131 is 1312112300001.
It is a happy number.
It is not a de Polignac number, because 1000032112131 - 21 = 1000032112129 is a prime.
It is a super-2 number, since 2×10000321121312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1000032112131.
It is not an unprimeable number, because it can be changed into a prime (1000032112139) 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, 25673775 + ... + 25712696.
It is an arithmetic number, because the mean of its divisors is an integer number (89926326000).
Almost surely, 21000032112131 is an apocalyptic number.
1000032112131 is a deficient number, since it is larger than the sum of its proper divisors (438789103869).
1000032112131 is a wasteful number, since it uses less digits than its factorization.
1000032112131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51386986.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1000032112131 its reverse (1312112300001), we get a palindrome (2312144412132).
The spelling of 1000032112131 in words is "one trillion, thirty-two million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •