Base | Representation |
---|---|
bin | 1001000111111000111000… |
… | …0000000101011111100011 |
3 | 1022111222002202202002112111 |
4 | 2101332032000011133203 |
5 | 2303322224020221311 |
6 | 33200123222540151 |
7 | 2053503530566255 |
oct | 221761600053743 |
9 | 38458082662474 |
10 | 10031131023331 |
11 | 32181a6a51680 |
12 | 1160125597657 |
13 | 579c15943ca2 |
14 | 26971b86dcd5 |
15 | 125dececed21 |
hex | 91f8e0057e3 |
10031131023331 has 16 divisors (see below), whose sum is σ = 10971763891200. Its totient is φ = 9095296291200.
The previous prime is 10031131023313. The next prime is 10031131023337. The reversal of 10031131023331 is 13332013113001.
It is a cyclic number.
It is not a de Polignac number, because 10031131023331 - 27 = 10031131023203 is a prime.
It is a super-2 number, since 2×100311310233312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10031131023337) 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, 15416635 + ... + 16054123.
It is an arithmetic number, because the mean of its divisors is an integer number (685735243200).
Almost surely, 210031131023331 is an apocalyptic number.
10031131023331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10031131023331 is a deficient number, since it is larger than the sum of its proper divisors (940632867869).
10031131023331 is a wasteful number, since it uses less digits than its factorization.
10031131023331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 641250.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 10031131023331 its reverse (13332013113001), we get a palindrome (23363144136332).
The spelling of 10031131023331 in words is "ten trillion, thirty-one billion, one hundred thirty-one million, twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.171 sec. • engine limits •