Base | Representation |
---|---|
bin | 11101101000011011110101… |
… | …010011011010011011010011 |
3 | 122002102122220011122211220120 |
4 | 131220123311103122123103 |
5 | 114040143440334432011 |
6 | 1141101034550241323 |
7 | 36310311655600032 |
oct | 3550336523323323 |
9 | 562378804584816 |
10 | 130322013202131 |
11 | 38585289a68063 |
12 | 12749342656243 |
13 | 579440bba8c8a |
14 | 2427894b1a719 |
15 | 100ee945e2a06 |
hex | 7686f54da6d3 |
130322013202131 has 8 divisors (see below), whose sum is σ = 173810173402560. Its totient is φ = 86857597568232.
The previous prime is 130322013202111. The next prime is 130322013202133. The reversal of 130322013202131 is 131202310223031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130322013202131 - 221 = 130322011104979 is a prime.
It is a super-2 number, since 2×1303220132021312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (130322013202133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5936128825 + ... + 5936150778.
It is an arithmetic number, because the mean of its divisors is an integer number (21726271675320).
Almost surely, 2130322013202131 is an apocalyptic number.
130322013202131 is a deficient number, since it is larger than the sum of its proper divisors (43488160200429).
130322013202131 is a wasteful number, since it uses less digits than its factorization.
130322013202131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11872283265.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 130322013202131 its reverse (131202310223031), we get a palindrome (261524323425162).
The spelling of 130322013202131 in words is "one hundred thirty trillion, three hundred twenty-two billion, thirteen million, two hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •