Base | Representation |
---|---|
bin | 1110000110100000111001… |
… | …11110011010110101010000 |
3 | 11001210112121200010201011011 |
4 | 13003100130332122311100 |
5 | 13031032241400031000 |
6 | 145541511035300304 |
7 | 6350260265625631 |
oct | 703203476326520 |
9 | 131715550121134 |
10 | 31010150002000 |
11 | 9976370274754 |
12 | 3589b845aa694 |
13 | 143c3244c5020 |
14 | 792c83841888 |
15 | 38b9a267d2ba |
hex | 1c341cf9ad50 |
31010150002000 has 960 divisors, whose sum is σ = 88190417952000. Its totient is φ = 10453764096000.
The previous prime is 31010150001913. The next prime is 31010150002043. The reversal of 31010150002000 is 20005101013.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 88854297826 + ... + 88854298174.
It is an arithmetic number, because the mean of its divisors is an integer number (91865018700).
Almost surely, 231010150002000 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 31010150002000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44095208976000).
31010150002000 is an abundant number, since it is smaller than the sum of its proper divisors (57180267950000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31010150002000 is a wasteful number, since it uses less digits than its factorization.
31010150002000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 593 (or 536 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 13.
Adding to 31010150002000 its reverse (20005101013), we get a palindrome (31030155103013).
The spelling of 31010150002000 in words is "thirty-one trillion, ten billion, one hundred fifty million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •