Base | Representation |
---|---|
bin | 111100101011111010… |
… | …0100111101001000011 |
3 | 110110101101122102011100 |
4 | 1321113310213221003 |
5 | 4113400020234111 |
6 | 135511433545443 |
7 | 12262340245026 |
oct | 1712764475103 |
9 | 413341572140 |
10 | 130322430531 |
11 | 502a6683a47 |
12 | 21310875283 |
13 | c39b927127 |
14 | 644423b1bd |
15 | 35cb303756 |
hex | 1e57d27a43 |
130322430531 has 12 divisors (see below), whose sum is σ = 189331625808. Its totient is φ = 86379413424.
The previous prime is 130322430481. The next prime is 130322430541. The reversal of 130322430531 is 135034223031.
130322430531 is a `hidden beast` number, since 1 + 3 + 0 + 322 + 4 + 305 + 31 = 666.
It is not a de Polignac number, because 130322430531 - 210 = 130322429507 is a prime.
It is a super-2 number, since 2×1303224305312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130322430495 and 130322430504.
It is not an unprimeable number, because it can be changed into a prime (130322430541) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 41848935 + ... + 41852048.
It is an arithmetic number, because the mean of its divisors is an integer number (15777635484).
Almost surely, 2130322430531 is an apocalyptic number.
130322430531 is a deficient number, since it is larger than the sum of its proper divisors (59009195277).
130322430531 is a wasteful number, since it uses less digits than its factorization.
130322430531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83701162 (or 83701159 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 130322430531 its reverse (135034223031), we get a palindrome (265356653562).
The spelling of 130322430531 in words is "one hundred thirty billion, three hundred twenty-two million, four hundred thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •