Base | Representation |
---|---|
bin | 1110000110010001111110… |
… | …00001100111100011100100 |
3 | 11001202202220211121000212110 |
4 | 13003020333001213203210 |
5 | 13030414331110100200 |
6 | 145534103231321020 |
7 | 6346554500224143 |
oct | 703107701474344 |
9 | 131682824530773 |
10 | 31002131331300 |
11 | 9972a25a04778 |
12 | 3588507080170 |
13 | 143b64714586c |
14 | 7927228b775a |
15 | 38b6836e5b50 |
hex | 1c323f0678e4 |
31002131331300 has 72 divisors (see below), whose sum is σ = 94420526317600. Its totient is φ = 7832117387520.
The previous prime is 31002131331277. The next prime is 31002131331323. The reversal of 31002131331300 is 313313120013.
It is an interprime number because it is at equal distance from previous prime (31002131331277) and next prime (31002131331323).
It is a super-2 number, since 2×310021313313002 (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 23 ways as a sum of consecutive naturals, for example, 2719479505 + ... + 2719490904.
Almost surely, 231002131331300 is an apocalyptic number.
31002131331300 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
31002131331300 is an abundant number, since it is smaller than the sum of its proper divisors (63418394986300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31002131331300 is a wasteful number, since it uses less digits than its factorization.
31002131331300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5438970445 (or 5438970438 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 31002131331300 its reverse (313313120013), we get a palindrome (31315444451313).
The spelling of 31002131331300 in words is "thirty-one trillion, two billion, one hundred thirty-one million, three hundred thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •