Base | Representation |
---|---|
bin | 1110000110010000000100… |
… | …11101011000101000000000 |
3 | 11001202200022000120012202212 |
4 | 13003020002131120220000 |
5 | 13030410240442400000 |
6 | 145533414332201252 |
7 | 6346520351236211 |
oct | 703100235305000 |
9 | 131680260505685 |
10 | 31001115200000 |
11 | 9972554373240 |
12 | 3588282909228 |
13 | 143b51477b13a |
14 | 79266796b408 |
15 | 38b6243c9c35 |
hex | 1c3202758a00 |
31001115200000 has 480 divisors, whose sum is σ = 84670208884800. Its totient is φ = 11245158400000.
The previous prime is 31001115199997. The next prime is 31001115200021. The reversal of 31001115200000 is 251110013.
It is a super-2 number, since 2×310011152000002 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7902398039 + ... + 7902401961.
It is an arithmetic number, because the mean of its divisors is an integer number (176396268510).
Almost surely, 231001115200000 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 31001115200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42335104442400).
31001115200000 is an abundant number, since it is smaller than the sum of its proper divisors (53669093684800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31001115200000 is an frugal number, since it uses more digits than its factorization.
31001115200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4426 (or 4390 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 14.
Adding to 31001115200000 its reverse (251110013), we get a palindrome (31001366310013).
The spelling of 31001115200000 in words is "thirty-one trillion, one billion, one hundred fifteen million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •