Base | Representation |
---|---|
bin | 1000001101111101… |
… | …1111100001110101 |
3 | 12200202010000100200 |
4 | 2003133133201311 |
5 | 14004223232101 |
6 | 1002523431113 |
7 | 105445202406 |
oct | 20337374165 |
9 | 5622100320 |
10 | 2206070901 |
11 | a322a67a1 |
12 | 516985499 |
13 | 2920789c8 |
14 | 16cdbb9ad |
15 | cda1a986 |
hex | 837df875 |
2206070901 has 6 divisors (see below), whose sum is σ = 3186546870. Its totient is φ = 1470713928.
The previous prime is 2206070879. The next prime is 2206070927. The reversal of 2206070901 is 1090706022.
It can be written as a sum of positive squares in only one way, i.e., 2009370276 + 196700625 = 44826^2 + 14025^2 .
It is not a de Polignac number, because 2206070901 - 29 = 2206070389 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2206070941) 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 5 ways as a sum of consecutive naturals, for example, 122559486 + ... + 122559503.
It is an arithmetic number, because the mean of its divisors is an integer number (531091145).
Almost surely, 22206070901 is an apocalyptic number.
It is an amenable number.
2206070901 is a deficient number, since it is larger than the sum of its proper divisors (980475969).
2206070901 is a wasteful number, since it uses less digits than its factorization.
2206070901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245118995 (or 245118992 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 2206070901 is about 46968.8290358616. The cubic root of 2206070901 is about 1301.7866756761.
Adding to 2206070901 its reverse (1090706022), we get a palindrome (3296776923).
The spelling of 2206070901 in words is "two billion, two hundred six million, seventy thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •