Base | Representation |
---|---|
bin | 1000101111010110110… |
… | …01010010111000000101 |
3 | 1001201010120020020102210 |
4 | 10113223121102320011 |
5 | 14410004304120401 |
6 | 345542402254033 |
7 | 30460523024406 |
oct | 4275331227005 |
9 | 1051116206383 |
10 | 300302020101 |
11 | 1063a2730496 |
12 | 4a24a657319 |
13 | 2241a586025 |
14 | 1076b2bd9ad |
15 | 7c28e6b4d6 |
hex | 45eb652e05 |
300302020101 has 48 divisors (see below), whose sum is σ = 436982031360. Its totient is φ = 182851115040.
The previous prime is 300302020091. The next prime is 300302020111. The reversal of 300302020101 is 101020203003.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (300302020091) and next prime (300302020111).
It is not a de Polignac number, because 300302020101 - 210 = 300302019077 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300302020111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 12013546 + ... + 12038516.
It is an arithmetic number, because the mean of its divisors is an integer number (9103792320).
Almost surely, 2300302020101 is an apocalyptic number.
It is an amenable number.
300302020101 is a deficient number, since it is larger than the sum of its proper divisors (136680011259).
300302020101 is a wasteful number, since it uses less digits than its factorization.
300302020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25174 (or 25107 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 300302020101 its reverse (101020203003), we get a palindrome (401322223104).
The spelling of 300302020101 in words is "three hundred billion, three hundred two million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •