Base | Representation |
---|---|
bin | 111100101011010101… |
… | …1101011100011000110 |
3 | 110110100001122222202100 |
4 | 1321112223223203012 |
5 | 4113330121410042 |
6 | 135505512052530 |
7 | 12262015601064 |
oct | 1712653534306 |
9 | 413301588670 |
10 | 130303310022 |
11 | 50296904476 |
12 | 21306394146 |
13 | c397991112 |
14 | 64418a1034 |
15 | 35c97c824c |
hex | 1e56aeb8c6 |
130303310022 has 24 divisors (see below), whose sum is σ = 282431166264. Its totient is φ = 43417924704.
The previous prime is 130303310017. The next prime is 130303310029. The reversal of 130303310022 is 220013303031.
130303310022 is a `hidden beast` number, since 1 + 30 + 303 + 310 + 0 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 130303309977 and 130303310004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130303310029) 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, 1327288 + ... + 1422075.
It is an arithmetic number, because the mean of its divisors is an integer number (11767965261).
Almost surely, 2130303310022 is an apocalyptic number.
130303310022 is an abundant number, since it is smaller than the sum of its proper divisors (152127856242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130303310022 is a wasteful number, since it uses less digits than its factorization.
130303310022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2752004 (or 2752001 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 130303310022 its reverse (220013303031), we get a palindrome (350316613053).
The spelling of 130303310022 in words is "one hundred thirty billion, three hundred three million, three hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •