Base | Representation |
---|---|
bin | 1110010011011111011110… |
… | …00111101111011101000000 |
3 | 11010101011120201101001221111 |
4 | 13021233233013233131000 |
5 | 13110334001131330413 |
6 | 150522414020133104 |
7 | 6424424265230224 |
oct | 711575707573500 |
9 | 133334521331844 |
10 | 31456057292608 |
11 | a028491313a43 |
12 | 3640489b37194 |
13 | 14723a79c1440 |
14 | 7aa6a496a784 |
15 | 39839e481d3d |
hex | 1c9bef1ef740 |
31456057292608 has 224 divisors, whose sum is σ = 73124689139712. Its totient is φ = 13305904128000.
The previous prime is 31456057292599. The next prime is 31456057292651. The reversal of 31456057292608 is 80629275065413.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 59652310 + ... + 60177322.
It is an arithmetic number, because the mean of its divisors is an integer number (326449505088).
It is a 1-persistent number, because it is pandigital, but 2⋅31456057292608 = 62912114585216 is not.
Almost surely, 231456057292608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31456057292608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36562344569856).
31456057292608 is an abundant number, since it is smaller than the sum of its proper divisors (41668631847104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31456057292608 is a wasteful number, since it uses less digits than its factorization.
31456057292608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525193 (or 525183 counting only the distinct ones).
The product of its (nonzero) digits is 21772800, while the sum is 58.
The spelling of 31456057292608 in words is "thirty-one trillion, four hundred fifty-six billion, fifty-seven million, two hundred ninety-two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •