Base | Representation |
---|---|
bin | 1110000110010000000100… |
… | …10101000010001100111000 |
3 | 11001202200021212110000000210 |
4 | 13003020002111002030320 |
5 | 13030410234412323000 |
6 | 145533414213231120 |
7 | 6346520323521246 |
oct | 703100225021470 |
9 | 131680255400023 |
10 | 31001113011000 |
11 | 9972553108650 |
12 | 35882820324a0 |
13 | 143b514192982 |
14 | 79266755b796 |
15 | 38b6240e6350 |
hex | 1c3202542338 |
31001113011000 has 256 divisors, whose sum is σ = 111723371435520. Its totient is φ = 7073337600000.
The previous prime is 31001113010993. The next prime is 31001113011061. The reversal of 31001113011000 is 11031110013.
It is a super-2 number, since 2×310011130110002 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 27069226 + ... + 28191225.
It is an arithmetic number, because the mean of its divisors is an integer number (436419419670).
Almost surely, 231001113011000 is an apocalyptic number.
31001113011000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
31001113011000 is an abundant number, since it is smaller than the sum of its proper divisors (80722258424520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31001113011000 is a wasteful number, since it uses less digits than its factorization.
31001113011000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55260503 (or 55260489 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 31001113011000 its reverse (11031110013), we get a palindrome (31012144121013).
The spelling of 31001113011000 in words is "thirty-one trillion, one billion, one hundred thirteen million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •