Base | Representation |
---|---|
bin | 111100101011111011… |
… | …0111010000100011111 |
3 | 110110101102202212220010 |
4 | 1321113312322010133 |
5 | 4113400143432203 |
6 | 135511454454303 |
7 | 12262345323444 |
oct | 1712766720437 |
9 | 413342685803 |
10 | 130323030303 |
11 | 502a6a53624 |
12 | 21310b04393 |
13 | c39baa711b |
14 | 64443559cb |
15 | 35cb3c1303 |
hex | 1e57dba11f |
130323030303 has 8 divisors (see below), whose sum is σ = 173765804416. Its totient is φ = 86881138200.
The previous prime is 130323030301. The next prime is 130323030347. The reversal of 130323030303 is 303030323031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130323030303 - 21 = 130323030301 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130323030303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130323030301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 299358 + ... + 591828.
It is an arithmetic number, because the mean of its divisors is an integer number (21720725552).
Almost surely, 2130323030303 is an apocalyptic number.
130323030303 is a deficient number, since it is larger than the sum of its proper divisors (43442774113).
130323030303 is a wasteful number, since it uses less digits than its factorization.
130323030303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441005.
The product of its (nonzero) digits is 1458, while the sum is 21.
Adding to 130323030303 its reverse (303030323031), we get a palindrome (433353353334).
The spelling of 130323030303 in words is "one hundred thirty billion, three hundred twenty-three million, thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •