Base | Representation |
---|---|
bin | 1110000110100000110111… |
… | …11101111100100111010100 |
3 | 11001210112120111100001100122 |
4 | 13003100123331330213110 |
5 | 13031032223033213022 |
6 | 145541505233131112 |
7 | 6350260002154622 |
oct | 703203375744724 |
9 | 131715514301318 |
10 | 31010133101012 |
11 | 997636178079a |
12 | 3589b7a9b9a98 |
13 | 143c320b58340 |
14 | 792c814c2512 |
15 | 38b9a0e40742 |
hex | 1c341bf7c9d4 |
31010133101012 has 12 divisors (see below), whose sum is σ = 58442173921236. Its totient is φ = 14312369123520.
The previous prime is 31010133101011. The next prime is 31010133101069. The reversal of 31010133101012 is 21010133101013.
It can be written as a sum of positive squares in 2 ways, for example, as 3781920320656 + 27228212780356 = 1944716^2 + 5218066^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31010133101011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 298174356689 + ... + 298174356792.
It is an arithmetic number, because the mean of its divisors is an integer number (4870181160103).
Almost surely, 231010133101012 is an apocalyptic number.
It is an amenable number.
31010133101012 is a deficient number, since it is larger than the sum of its proper divisors (27432040820224).
31010133101012 is a wasteful number, since it uses less digits than its factorization.
31010133101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 596348713498 (or 596348713496 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 31010133101012 its reverse (21010133101013), we get a palindrome (52020266202025).
Subtracting from 31010133101012 its reverse (21010133101013), we obtain a palindrome (9999999999999).
The spelling of 31010133101012 in words is "thirty-one trillion, ten billion, one hundred thirty-three million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •