Base | Representation |
---|---|
bin | 11101110100010000001011… |
… | …111101101110011110100000 |
3 | 122012022022010211200010111221 |
4 | 131310100023331232132200 |
5 | 114142000210401241000 |
6 | 1142522105425344424 |
7 | 36423062201353624 |
oct | 3564201375563640 |
9 | 565268124603457 |
10 | 131134142212000 |
11 | 3886874a689454 |
12 | 1285a812a98114 |
13 | 5822b8694a065 |
14 | 2454cd7c83184 |
15 | 102617763a61a |
hex | 77440bf6e7a0 |
131134142212000 has 144 divisors (see below), whose sum is σ = 336814207401672. Its totient is φ = 50173062297600.
The previous prime is 131134142211953. The next prime is 131134142212039. The reversal of 131134142212000 is 212241431131.
It can be written as a sum of positive squares in 4 ways, for example, as 52718229175824 + 78415913036176 = 7260732^2 + 8855276^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
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, 28870329 + ... + 33102328.
Almost surely, 2131134142212000 is an apocalyptic number.
131134142212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131134142212000 is an abundant number, since it is smaller than the sum of its proper divisors (205680065189672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131134142212000 is an equidigital number, since it uses as much as digits as its factorization.
131134142212000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61972728 (or 61972687 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 131134142212000 its reverse (212241431131), we get a palindrome (131346383643131).
The spelling of 131134142212000 in words is "one hundred thirty-one trillion, one hundred thirty-four billion, one hundred forty-two million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •