Base | Representation |
---|---|
bin | 11101110010010011100011… |
… | …100111110110011000000000 |
3 | 122011211111201122012122102021 |
4 | 131302103203213312120000 |
5 | 114132302124234333433 |
6 | 1142340414501131224 |
7 | 36410314041266605 |
oct | 3562234347663000 |
9 | 564744648178367 |
10 | 131000321402368 |
11 | 38816a19295510 |
12 | 128388a66b9b14 |
13 | 581337b303332 |
14 | 244c64118a6ac |
15 | 102294414a22d |
hex | 7724e39f6600 |
131000321402368 has 80 divisors (see below), whose sum is σ = 288483473157264. Its totient is φ = 58931728220160.
The previous prime is 131000321402311. The next prime is 131000321402369. The reversal of 131000321402368 is 863204123000131.
It is a super-2 number, since 2×1310003214023682 (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 (131000321402369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119350605 + ... + 120443212.
Almost surely, 2131000321402368 is an apocalyptic number.
It is an amenable number.
131000321402368 is an abundant number, since it is smaller than the sum of its proper divisors (157483151754896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131000321402368 is an equidigital number, since it uses as much as digits as its factorization.
131000321402368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239793943 (or 239793927 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 34.
Adding to 131000321402368 its reverse (863204123000131), we get a palindrome (994204444402499).
The spelling of 131000321402368 in words is "one hundred thirty-one trillion, three hundred twenty-one million, four hundred two thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •