Base | Representation |
---|---|
bin | 1000110010100101000… |
… | …00101011111101101001 |
3 | 1001212121010111212221222 |
4 | 10121102200223331221 |
5 | 14422030143323423 |
6 | 350430202111425 |
7 | 30551430510110 |
oct | 4312240537551 |
9 | 1055533455858 |
10 | 302032011113 |
11 | 107100218328 |
12 | 4a651aab575 |
13 | 22634b03451 |
14 | 10892d70c77 |
15 | 7ccac963c8 |
hex | 465282bf69 |
302032011113 has 16 divisors (see below), whose sum is σ = 365522699520. Its totient is φ = 243630352896.
The previous prime is 302032011107. The next prime is 302032011161. The reversal of 302032011113 is 311110230203.
It is not a de Polignac number, because 302032011113 - 216 = 302031945577 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 302032011091 and 302032011100.
It is not an unprimeable number, because it can be changed into a prime (302032011163) 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 15 ways as a sum of consecutive naturals, for example, 1041068 + ... + 1299186.
It is an arithmetic number, because the mean of its divisors is an integer number (22845168720).
Almost surely, 2302032011113 is an apocalyptic number.
It is an amenable number.
302032011113 is a deficient number, since it is larger than the sum of its proper divisors (63490688407).
302032011113 is a wasteful number, since it uses less digits than its factorization.
302032011113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267976.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 302032011113 its reverse (311110230203), we get a palindrome (613142241316).
The spelling of 302032011113 in words is "three hundred two billion, thirty-two million, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.002 sec. • engine limits •