Base | Representation |
---|---|
bin | 11101101000100100010011… |
… | …111000000001111111001111 |
3 | 122002110112101120021120000021 |
4 | 131220210103320001333033 |
5 | 114040321111202134211 |
6 | 1141105142124043011 |
7 | 36311053360544140 |
oct | 3550442370017717 |
9 | 562415346246007 |
10 | 130331116052431 |
11 | 38589130317238 |
12 | 1274b063093467 |
13 | 579522ca5a228 |
14 | 24280b9a65ac7 |
15 | 1010328838771 |
hex | 768913e01fcf |
130331116052431 has 16 divisors (see below), whose sum is σ = 151677943372800. Its totient is φ = 109682112634848.
The previous prime is 130331116052419. The next prime is 130331116052437. The reversal of 130331116052431 is 134250611133031.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130331116052431 is a prime.
It is a super-2 number, since 2×1303311160524312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130331116052437) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 658225420 + ... + 658423393.
It is an arithmetic number, because the mean of its divisors is an integer number (9479871460800).
Almost surely, 2130331116052431 is an apocalyptic number.
130331116052431 is a deficient number, since it is larger than the sum of its proper divisors (21346827320369).
130331116052431 is a wasteful number, since it uses less digits than its factorization.
130331116052431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1316649078.
The product of its (nonzero) digits is 19440, while the sum is 34.
Adding to 130331116052431 its reverse (134250611133031), we get a palindrome (264581727185462).
The spelling of 130331116052431 in words is "one hundred thirty trillion, three hundred thirty-one billion, one hundred sixteen million, fifty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •