Base | Representation |
---|---|
bin | 11101110010011100101011… |
… | …001000101010011110010100 |
3 | 122011212102222220021220010221 |
4 | 131302130223020222132110 |
5 | 114132432201421340200 |
6 | 1142345114132524124 |
7 | 36411111453444325 |
oct | 3562345310523624 |
9 | 564772886256127 |
10 | 131010111121300 |
11 | 38820092335214 |
12 | 1283a779180644 |
13 | 581427b576a28 |
14 | 244cccd41244c |
15 | 1022d1881c91a |
hex | 77272b22a794 |
131010111121300 has 72 divisors (see below), whose sum is σ = 284534925161760. Its totient is φ = 52359269577600.
The previous prime is 131010111121261. The next prime is 131010111121301. The reversal of 131010111121300 is 3121111010131.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131010111121301) 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, 732092835 + ... + 732271765.
It is an arithmetic number, because the mean of its divisors is an integer number (3951873960580).
Almost surely, 2131010111121300 is an apocalyptic number.
131010111121300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131010111121300 is an abundant number, since it is smaller than the sum of its proper divisors (153524814040460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131010111121300 is a wasteful number, since it uses less digits than its factorization.
131010111121300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 185161 (or 185154 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 131010111121300 its reverse (3121111010131), we get a palindrome (134131222131431).
The spelling of 131010111121300 in words is "one hundred thirty-one trillion, ten billion, one hundred eleven million, one hundred twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •