Base | Representation |
---|---|
bin | 100100100110110010101… |
… | …0000111000000000010100 |
3 | 122210222011101211122201022 |
4 | 1021031211100320000110 |
5 | 1124412201020014012 |
6 | 14411131422020312 |
7 | 1026325326135605 |
oct | 111154520700024 |
9 | 18728141748638 |
10 | 5031105626132 |
11 | 166a752a688a3 |
12 | 69308b117698 |
13 | 2a657b529ac1 |
14 | 135714995dac |
15 | 8ad0d443472 |
hex | 49365438014 |
5031105626132 has 72 divisors (see below), whose sum is σ = 9159072115200. Its totient is φ = 2417471259840.
The previous prime is 5031105626111. The next prime is 5031105626203. The reversal of 5031105626132 is 2316265011305.
It is a super-2 number, since 2×50311056261322 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5031105626092 and 5031105626101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 322850813 + ... + 322866395.
Almost surely, 25031105626132 is an apocalyptic number.
It is an amenable number.
5031105626132 is a deficient number, since it is larger than the sum of its proper divisors (4127966489068).
5031105626132 is a wasteful number, since it uses less digits than its factorization.
5031105626132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16341 (or 16292 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 5031105626132 in words is "five trillion, thirty-one billion, one hundred five million, six hundred twenty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.490 sec. • engine limits •