Base | Representation |
---|---|
bin | 1000110010100010101… |
… | …01100000001110000101 |
3 | 1001212112202102120102201 |
4 | 10121101111200032011 |
5 | 14422010122132323 |
6 | 350424215434501 |
7 | 30551101132546 |
oct | 4312125401605 |
9 | 1055482376381 |
10 | 302012302213 |
11 | 1070a0086786 |
12 | 4a647385a31 |
13 | 226309c268b |
14 | 108904c04cd |
15 | 7cc91a18ad |
hex | 4651560385 |
302012302213 has 8 divisors (see below), whose sum is σ = 317936967200. Its totient is φ = 286090565328.
The previous prime is 302012302201. The next prime is 302012302237. The reversal of 302012302213 is 312203210203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 302012302213 - 25 = 302012302181 is a prime.
It is a super-2 number, since 2×3020123022132 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302012302243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 518706 + ... + 934387.
It is an arithmetic number, because the mean of its divisors is an integer number (39742120900).
Almost surely, 2302012302213 is an apocalyptic number.
It is an amenable number.
302012302213 is a deficient number, since it is larger than the sum of its proper divisors (15924664987).
302012302213 is a wasteful number, since it uses less digits than its factorization.
302012302213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1464051.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 302012302213 its reverse (312203210203), we get a palindrome (614215512416).
The spelling of 302012302213 in words is "three hundred two billion, twelve million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •