Base | Representation |
---|---|
bin | 1001000111111000100000… |
… | …1010001111011001001111 |
3 | 1022111221211221100010000201 |
4 | 2101332020022033121033 |
5 | 2303322023423201111 |
6 | 33200105402234331 |
7 | 2053501230600220 |
oct | 221761012173117 |
9 | 38457757303021 |
10 | 10031033022031 |
11 | 32181566a586a |
12 | 11600b87b59a7 |
13 | 579bcb550158 |
14 | 26970c83d247 |
15 | 125de45c26c1 |
hex | 91f8828f64f |
10031033022031 has 16 divisors (see below), whose sum is σ = 11522884538880. Its totient is φ = 8553987419040.
The previous prime is 10031033022001. The next prime is 10031033022047. The reversal of 10031033022031 is 13022033013001.
10031033022031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10031033022031 - 221 = 10031030924879 is a prime.
It is a super-2 number, since 2×100310330220312 (a number of 27 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 (10031033022001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2647315 + ... + 5202916.
It is an arithmetic number, because the mean of its divisors is an integer number (720180283680).
Almost surely, 210031033022031 is an apocalyptic number.
10031033022031 is a deficient number, since it is larger than the sum of its proper divisors (1491851516849).
10031033022031 is an equidigital number, since it uses as much as digits as its factorization.
10031033022031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7851174.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 10031033022031 its reverse (13022033013001), we get a palindrome (23053066035032).
The spelling of 10031033022031 in words is "ten trillion, thirty-one billion, thirty-three million, twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •