Base | Representation |
---|---|
bin | 10010000000011… |
… | …110000100000111 |
3 | 210001110221011112 |
4 | 102000132010013 |
5 | 1104320104111 |
6 | 45551155235 |
7 | 10325630003 |
oct | 2200360407 |
9 | 701427145 |
10 | 302113031 |
11 | 145597aa0 |
12 | 85215b1b |
13 | 4a78a80c |
14 | 2c1a3703 |
15 | 1b7c9e8b |
hex | 1201e107 |
302113031 has 8 divisors (see below), whose sum is σ = 330025728. Its totient is φ = 274275000.
The previous prime is 302113013. The next prime is 302113033. The reversal of 302113031 is 130311203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-302113031 is a prime.
It is a super-2 number, since 2×3021130312 = 182544567000013922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 302112997 and 302113015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302113033) 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, 10025 + ... + 26546.
It is an arithmetic number, because the mean of its divisors is an integer number (41253216).
Almost surely, 2302113031 is an apocalyptic number.
302113031 is a deficient number, since it is larger than the sum of its proper divisors (27912697).
302113031 is a wasteful number, since it uses less digits than its factorization.
302113031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37333.
The product of its (nonzero) digits is 54, while the sum is 14.
The square root of 302113031 is about 17381.3989943272. The cubic root of 302113031 is about 671.0009772530. Note that the first 3 decimals are identical.
Adding to 302113031 its reverse (130311203), we get a palindrome (432424234).
The spelling of 302113031 in words is "three hundred two million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •