Base | Representation |
---|---|
bin | 1000110010100010101… |
… | …00110011111111000111 |
3 | 1001212112202002100220021 |
4 | 10121101110303333013 |
5 | 14422010100333111 |
6 | 350424211520011 |
7 | 30551066446405 |
oct | 4312124637707 |
9 | 1055482070807 |
10 | 302012121031 |
11 | 10709aa72645 |
12 | 4a6472b9007 |
13 | 2263095b07a |
14 | 10890474475 |
15 | 7cc9167d71 |
hex | 4651533fc7 |
302012121031 has 8 divisors (see below), whose sum is σ = 309087228240. Its totient is φ = 295002222528.
The previous prime is 302012121017. The next prime is 302012121053. The reversal of 302012121031 is 130121210203.
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 302012121031 - 29 = 302012120519 is a prime.
It is a super-2 number, since 2×3020121210312 (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 = 302012120996 and 302012121014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302012121431) 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, 16292806 + ... + 16311331.
It is an arithmetic number, because the mean of its divisors is an integer number (38635903530).
Almost surely, 2302012121031 is an apocalyptic number.
302012121031 is a deficient number, since it is larger than the sum of its proper divisors (7075107209).
302012121031 is a wasteful number, since it uses less digits than its factorization.
302012121031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32604353.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 302012121031 its reverse (130121210203), we get a palindrome (432133331234).
The spelling of 302012121031 in words is "three hundred two billion, twelve million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •