Base | Representation |
---|---|
bin | 11101110011111100100111… |
… | …000111111010111110101000 |
3 | 122012020021212222101012111211 |
4 | 131303330213013322332220 |
5 | 114141124133444024000 |
6 | 1142504312011402504 |
7 | 36421416262316443 |
oct | 3563744707727650 |
9 | 565207788335454 |
10 | 131113123033000 |
11 | 3885a843927139 |
12 | 12856727753434 |
13 | 5820bb707b734 |
14 | 2453ca249a65a |
15 | 10258471a07ba |
hex | 773f271fafa8 |
131113123033000 has 128 divisors (see below), whose sum is σ = 328068404820000. Its totient is φ = 48871518720000.
The previous prime is 131113123032989. The next prime is 131113123033001. The reversal of 131113123033000 is 330321311131.
It can be written as a sum of positive squares in 16 ways, for example, as 15325236244516 + 115787886788484 = 3914746^2 + 10760478^2 .
It is not an unprimeable number, because it can be changed into a prime (131113123033001) 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, 36463875 + ... + 39897874.
Almost surely, 2131113123033000 is an apocalyptic number.
131113123033000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131113123033000 is an abundant number, since it is smaller than the sum of its proper divisors (196955281787000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131113123033000 is a wasteful number, since it uses less digits than its factorization.
131113123033000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76361888 (or 76361874 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 131113123033000 its reverse (330321311131), we get a palindrome (131443444344131).
The spelling of 131113123033000 in words is "one hundred thirty-one trillion, one hundred thirteen billion, one hundred twenty-three million, thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •