Base | Representation |
---|---|
bin | 1110000110111101001001… |
… | …01001000011000111011100 |
3 | 11001211222202021020100211102 |
4 | 13003132210221003013130 |
5 | 13031304314104044400 |
6 | 145552455304212232 |
7 | 6351335062204211 |
oct | 703364451030734 |
9 | 131758667210742 |
10 | 31025311003100 |
11 | 9981840262227 |
12 | 3590ab5a6a078 |
13 | 144089c4c23ab |
14 | 7938c11b5b08 |
15 | 38c08d6969d5 |
hex | 1c37a4a431dc |
31025311003100 has 72 divisors (see below), whose sum is σ = 71473303697040. Its totient is φ = 11649298590720.
The previous prime is 31025311003067. The next prime is 31025311003109. The reversal of 31025311003100 is 130011352013.
It is a super-2 number, since 2×310253110031002 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31025311003109) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23432459 + ... + 24721058.
It is an arithmetic number, because the mean of its divisors is an integer number (992684773570).
Almost surely, 231025311003100 is an apocalyptic number.
It is an amenable number.
31025311003100 is an abundant number, since it is smaller than the sum of its proper divisors (40447992693940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31025311003100 is a wasteful number, since it uses less digits than its factorization.
31025311003100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48153927 (or 48153920 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 20.
Adding to 31025311003100 its reverse (130011352013), we get a palindrome (31155322355113).
The spelling of 31025311003100 in words is "thirty-one trillion, twenty-five billion, three hundred eleven million, three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •