Base | Representation |
---|---|
bin | 110111111110010011… |
… | …0010001111001011101 |
3 | 102111021002021210101220 |
4 | 1233330212101321131 |
5 | 3432133203311310 |
6 | 131115310123553 |
7 | 11453501141304 |
oct | 1577446217135 |
9 | 374232253356 |
10 | 120202010205 |
11 | 46a829a0402 |
12 | 1b3674b05b9 |
13 | b447cc6634 |
14 | 5b640cd43b |
15 | 31d7aaa670 |
hex | 1bfc991e5d |
120202010205 has 16 divisors (see below), whose sum is σ = 192446616960. Its totient is φ = 64066605248.
The previous prime is 120202010183. The next prime is 120202010209. The reversal of 120202010205 is 502010202021.
It is a cyclic number.
It is not a de Polignac number, because 120202010205 - 29 = 120202009693 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120202010209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2546682 + ... + 2593451.
It is an arithmetic number, because the mean of its divisors is an integer number (12027913560).
Almost surely, 2120202010205 is an apocalyptic number.
120202010205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
120202010205 is a deficient number, since it is larger than the sum of its proper divisors (72244606755).
120202010205 is a wasteful number, since it uses less digits than its factorization.
120202010205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5141700.
The product of its (nonzero) digits is 80, while the sum is 15.
Adding to 120202010205 its reverse (502010202021), we get a palindrome (622212212226).
The spelling of 120202010205 in words is "one hundred twenty billion, two hundred two million, ten thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •