Base | Representation |
---|---|
bin | 1110001010001100000001… |
… | …00001100111111100110101 |
3 | 11002020121102110021200211212 |
4 | 13011012000201213330311 |
5 | 13040114243300223431 |
6 | 150115504114411205 |
7 | 6362346244060100 |
oct | 705060041477465 |
9 | 132217373250755 |
10 | 31136374226741 |
11 | 9a14953588a63 |
12 | 35aa530890b05 |
13 | 144b1bc0647c4 |
14 | 799019683737 |
15 | 38edddcad72b |
hex | 1c5180867f35 |
31136374226741 has 12 divisors (see below), whose sum is σ = 36220346783712. Its totient is φ = 26687964954168.
The previous prime is 31136374226701. The next prime is 31136374226767. The reversal of 31136374226741 is 14762247363113.
It is not a de Polignac number, because 31136374226741 - 230 = 31135300484917 is a prime.
It is a super-2 number, since 2×311363742267412 (a number of 28 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 31136374226741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31136374226701) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 489545 + ... + 7906478.
It is an arithmetic number, because the mean of its divisors is an integer number (3018362231976).
Almost surely, 231136374226741 is an apocalyptic number.
It is an amenable number.
31136374226741 is a deficient number, since it is larger than the sum of its proper divisors (5083972556971).
31136374226741 is an equidigital number, since it uses as much as digits as its factorization.
31136374226741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8471720 (or 8471713 counting only the distinct ones).
The product of its digits is 3048192, while the sum is 50.
The spelling of 31136374226741 in words is "thirty-one trillion, one hundred thirty-six billion, three hundred seventy-four million, two hundred twenty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •