Base | Representation |
---|---|
bin | 111100101011010101… |
… | …1101110100000010100 |
3 | 110110100001200121100212 |
4 | 1321112223232200110 |
5 | 4113330122302012 |
6 | 135505512224552 |
7 | 12262015651304 |
oct | 1712653564024 |
9 | 413301617325 |
10 | 130303322132 |
11 | 50296912585 |
12 | 2130639b158 |
13 | c397996799 |
14 | 64418a5604 |
15 | 35c97cbb22 |
hex | 1e56aee814 |
130303322132 has 12 divisors (see below), whose sum is σ = 235386646656. Its totient is φ = 63049994520.
The previous prime is 130303322129. The next prime is 130303322137. The reversal of 130303322132 is 231223303031.
It is a super-2 number, since 2×1303033221322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130303322098 and 130303322107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130303322137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 525416498 + ... + 525416745.
It is an arithmetic number, because the mean of its divisors is an integer number (19615553888).
Almost surely, 2130303322132 is an apocalyptic number.
It is an amenable number.
130303322132 is a deficient number, since it is larger than the sum of its proper divisors (105083324524).
130303322132 is a wasteful number, since it uses less digits than its factorization.
130303322132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1050833278 (or 1050833276 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 130303322132 its reverse (231223303031), we get a palindrome (361526625163).
The spelling of 130303322132 in words is "one hundred thirty billion, three hundred three million, three hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •