Base | Representation |
---|---|
bin | 100010010101011010011010… |
… | …1111010111111110011111000 |
3 | 1110121022212220112101021002102 |
4 | 1010222310311322333303320 |
5 | 304041113211210323000 |
6 | 2550153311144122532 |
7 | 120420340212605312 |
oct | 10452646572776370 |
9 | 1417285815337072 |
10 | 302010120011000 |
11 | 882588553a4365 |
12 | 29a57702166448 |
13 | cc6958048557b |
14 | 54815213687b2 |
15 | 24dae9a0033d5 |
hex | 112ad35ebfcf8 |
302010120011000 has 64 divisors (see below), whose sum is σ = 708838738040160. Its totient is φ = 120439080960000.
The previous prime is 302010120010931. The next prime is 302010120011069. The reversal of 302010120011000 is 110021010203.
It is an interprime number because it is at equal distance from previous prime (302010120010931) and next prime (302010120011069).
It is a super-2 number, since 2×3020101200110002 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 455877641 + ... + 456539640.
Almost surely, 2302010120011000 is an apocalyptic number.
It is an amenable number.
302010120011000 is an abundant number, since it is smaller than the sum of its proper divisors (406828618029160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
302010120011000 is a wasteful number, since it uses less digits than its factorization.
302010120011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 912417633 (or 912417619 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 302010120011000 its reverse (110021010203), we get a palindrome (302120141021203).
The spelling of 302010120011000 in words is "three hundred two trillion, ten billion, one hundred twenty million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •