Base | Representation |
---|---|
bin | 1000110010100010100… |
… | …01000000000110110100 |
3 | 1001212112200012121121211 |
4 | 10121101101000012310 |
5 | 14422004321401400 |
6 | 350424134251204 |
7 | 30551055116152 |
oct | 4312121000664 |
9 | 1055480177554 |
10 | 302011122100 |
11 | 10709a450086 |
12 | 4a646ab6b04 |
13 | 2263069b49c |
14 | 108902943d2 |
15 | 7cc901bdba |
hex | 46514401b4 |
302011122100 has 18 divisors (see below), whose sum is σ = 655364135174. Its totient is φ = 120804448800.
The previous prime is 302011122041. The next prime is 302011122109. The reversal of 302011122100 is 1221110203.
It can be written as a sum of positive squares in 3 ways, for example, as 58048228624 + 243962893476 = 240932^2 + 493926^2 .
It is a super-2 number, since 2×3020111221002 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302011122109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1510055511 + ... + 1510055710.
Almost surely, 2302011122100 is an apocalyptic number.
It is an amenable number.
302011122100 is an abundant number, since it is smaller than the sum of its proper divisors (353353013074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
302011122100 is a wasteful number, since it uses less digits than its factorization.
302011122100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3020111235 (or 3020111228 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 302011122100 its reverse (1221110203), we get a palindrome (303232232303).
The spelling of 302011122100 in words is "three hundred two billion, eleven million, one hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •