Base | Representation |
---|---|
bin | 11001110001001011111010… |
… | …101000101001010000011000 |
3 | 112212021100200000200112122110 |
4 | 121301023322220221100120 |
5 | 104323304310234443000 |
6 | 1041011350130352320 |
7 | 32604624040552245 |
oct | 3161137250512030 |
9 | 485240600615573 |
10 | 113331212031000 |
11 | 33124551720007 |
12 | 1086442172b6a0 |
13 | 4b3111a13c652 |
14 | 1ddb38d3665cc |
15 | d18011854850 |
hex | 6712faa29418 |
113331212031000 has 128 divisors (see below), whose sum is σ = 353597633438400. Its totient is φ = 30221293132800.
The previous prime is 113331212030999. The next prime is 113331212031007. The reversal of 113331212031000 is 130212133311.
It is a happy number.
It is a super-2 number, since 2×1133312120310002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113331212031007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 328654674 + ... + 328999326.
Almost surely, 2113331212031000 is an apocalyptic number.
113331212031000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113331212031000 is an abundant number, since it is smaller than the sum of its proper divisors (240266421407400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113331212031000 is a wasteful number, since it uses less digits than its factorization.
113331212031000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 454286 (or 454272 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 113331212031000 its reverse (130212133311), we get a palindrome (113461424164311).
The spelling of 113331212031000 in words is "one hundred thirteen trillion, three hundred thirty-one billion, two hundred twelve million, thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •