Base | Representation |
---|---|
bin | 1110001001101001000001… |
… | …00110101001010110000000 |
3 | 11002011210221000011012021121 |
4 | 13010310200212221112000 |
5 | 13034312303233424443 |
6 | 150103115441402024 |
7 | 6361112523565000 |
oct | 704644046512600 |
9 | 132153830135247 |
10 | 31117585061248 |
11 | 9a07991595914 |
12 | 35a6968339314 |
13 | 14494b64a59ba |
14 | 79815610c000 |
15 | 38e68e4bd4ed |
hex | 1c4d209a9580 |
31117585061248 has 64 divisors (see below), whose sum is σ = 72293952276000. Its totient is φ = 13336107864576.
The previous prime is 31117585061209. The next prime is 31117585061273. The reversal of 31117585061248 is 84216058571113.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×311175850612482 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31117585061195 and 31117585061204.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 354338215 + ... + 354426022.
Almost surely, 231117585061248 is an apocalyptic number.
It is an amenable number.
31117585061248 is an abundant number, since it is smaller than the sum of its proper divisors (41176367214752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31117585061248 is an frugal number, since it uses more digits than its factorization.
31117585061248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708764272 (or 708764246 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 52.
The spelling of 31117585061248 in words is "thirty-one trillion, one hundred seventeen billion, five hundred eighty-five million, sixty-one thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •