Base | Representation |
---|---|
bin | 1000110010100101010… |
… | …01100101001000001101 |
3 | 1001212121021220022220102 |
4 | 10121102221211020031 |
5 | 14422031242424123 |
6 | 350430324100445 |
7 | 30551456356646 |
oct | 4312251451015 |
9 | 1055537808812 |
10 | 302034342413 |
11 | 10710156a921 |
12 | 4a652834725 |
13 | 2263543b60b |
14 | 108933ba6cd |
15 | 7ccb0a7028 |
hex | 4652a6520d |
302034342413 has 4 divisors (see below), whose sum is σ = 315166270368. Its totient is φ = 288902414460.
The previous prime is 302034342397. The next prime is 302034342427. The reversal of 302034342413 is 314243430203.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 314243430203 = 17 ⋅18484907659.
It is a cyclic number.
It is not a de Polignac number, because 302034342413 - 24 = 302034342397 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302034342713) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6565963943 + ... + 6565963988.
It is an arithmetic number, because the mean of its divisors is an integer number (78791567592).
Almost surely, 2302034342413 is an apocalyptic number.
It is an amenable number.
302034342413 is a deficient number, since it is larger than the sum of its proper divisors (13131927955).
302034342413 is a wasteful number, since it uses less digits than its factorization.
302034342413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13131927954.
The product of its (nonzero) digits is 20736, while the sum is 29.
Adding to 302034342413 its reverse (314243430203), we get a palindrome (616277772616).
The spelling of 302034342413 in words is "three hundred two billion, thirty-four million, three hundred forty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •