Base | Representation |
---|---|
bin | 100100010110111… |
… | …1011101000101101 |
3 | 10011000122102210100 |
4 | 1020231323220231 |
5 | 4444310002201 |
6 | 321020501313 |
7 | 42142555122 |
oct | 11055735055 |
9 | 3130572710 |
10 | 1220000301 |
11 | 576727313 |
12 | 2a06aa839 |
13 | 1659a7a90 |
14 | b8058749 |
15 | 7218b886 |
hex | 48b7ba2d |
1220000301 has 12 divisors (see below), whose sum is σ = 1897778428. Its totient is φ = 750769344.
The previous prime is 1220000263. The next prime is 1220000321. The reversal of 1220000301 is 1030000221.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 77898276 + 1142102025 = 8826^2 + 33795^2 .
It is not a de Polignac number, because 1220000301 - 29 = 1219999789 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220000321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5213560 + ... + 5213793.
Almost surely, 21220000301 is an apocalyptic number.
It is an amenable number.
1220000301 is a deficient number, since it is larger than the sum of its proper divisors (677778127).
1220000301 is a wasteful number, since it uses less digits than its factorization.
1220000301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10427372 (or 10427369 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 1220000301 is about 34928.5027019482. The cubic root of 1220000301 is about 1068.5298180252.
Adding to 1220000301 its reverse (1030000221), we get a palindrome (2250000522).
The spelling of 1220000301 in words is "one billion, two hundred twenty million, three hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •