Base | Representation |
---|---|
bin | 1000110010100001101… |
… | …10110000101110000011 |
3 | 1001212112012021010201121 |
4 | 10121100312300232003 |
5 | 14422001041241311 |
6 | 350423331013111 |
7 | 30550642466350 |
oct | 4312066605603 |
9 | 1055465233647 |
10 | 302004243331 |
11 | 107096581a4a |
12 | 4a64473a197 |
13 | 2262c1304cb |
14 | 1088d3c3627 |
15 | 7cc860db71 |
hex | 4650db0b83 |
302004243331 has 16 divisors (see below), whose sum is σ = 347054865408. Its totient is φ = 257434257600.
The previous prime is 302004243301. The next prime is 302004243367. The reversal of 302004243331 is 133342400203.
It is a cyclic number.
It is not a de Polignac number, because 302004243331 - 211 = 302004241283 is a prime.
It is a super-2 number, since 2×3020042433312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 302004243296 and 302004243305.
It is not an unprimeable number, because it can be changed into a prime (302004243301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 784416 + ... + 1104226.
It is an arithmetic number, because the mean of its divisors is an integer number (21690929088).
Almost surely, 2302004243331 is an apocalyptic number.
302004243331 is a deficient number, since it is larger than the sum of its proper divisors (45050622077).
302004243331 is a wasteful number, since it uses less digits than its factorization.
302004243331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320562.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 302004243331 its reverse (133342400203), we get a palindrome (435346643534).
The spelling of 302004243331 in words is "three hundred two billion, four million, two hundred forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •