Base | Representation |
---|---|
bin | 11101101000100011100101… |
… | …000101010111101101100011 |
3 | 122002110110100212002210010220 |
4 | 131220203211011113231203 |
5 | 114040313004220121011 |
6 | 1141104532202054123 |
7 | 36311025046100214 |
oct | 3550434505275543 |
9 | 562413325083126 |
10 | 130330331020131 |
11 | 38588868179910 |
12 | 1274aa841aa343 |
13 | 5795136218088 |
14 | 24280436b540b |
15 | 10102ce96b506 |
hex | 7688e5157b63 |
130330331020131 has 32 divisors (see below), whose sum is σ = 191450386895616. Its totient is φ = 78205181040000.
The previous prime is 130330331020129. The next prime is 130330331020159. The reversal of 130330331020131 is 131020133033031.
It is not a de Polignac number, because 130330331020131 - 21 = 130330331020129 is a prime.
It is a super-2 number, since 2×1303303310201312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (130330331020171) 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, 467217160 + ... + 467496026.
It is an arithmetic number, because the mean of its divisors is an integer number (5982824590488).
Almost surely, 2130330331020131 is an apocalyptic number.
130330331020131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130330331020131 is a deficient number, since it is larger than the sum of its proper divisors (61120055875485).
130330331020131 is a wasteful number, since it uses less digits than its factorization.
130330331020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419203.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 130330331020131 its reverse (131020133033031), we get a palindrome (261350464053162).
The spelling of 130330331020131 in words is "one hundred thirty trillion, three hundred thirty billion, three hundred thirty-one million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •