Base | Representation |
---|---|
bin | 110111111110100100… |
… | …1000010000001010010 |
3 | 102111021201102121222111 |
4 | 1233331021002001102 |
5 | 3432143021321320 |
6 | 131120233255534 |
7 | 11453641443136 |
oct | 1577511020122 |
9 | 374251377874 |
10 | 120211120210 |
11 | 46a88052935 |
12 | 1b36a5645aa |
13 | b449b6607c |
14 | 5b653c13c6 |
15 | 31d87a9a5a |
hex | 1bfd242052 |
120211120210 has 8 divisors (see below), whose sum is σ = 216380016396. Its totient is φ = 48084448080.
The previous prime is 120211120207. The next prime is 120211120213. The reversal of 120211120210 is 12021112021.
It is an interprime number because it is at equal distance from previous prime (120211120207) and next prime (120211120213).
It can be written as a sum of positive squares in 2 ways, for example, as 102732429361 + 17478690849 = 320519^2 + 132207^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (120211120213) 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 3 ways as a sum of consecutive naturals, for example, 6010556001 + ... + 6010556020.
Almost surely, 2120211120210 is an apocalyptic number.
120211120210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120211120210 is a deficient number, since it is larger than the sum of its proper divisors (96168896186).
120211120210 is a wasteful number, since it uses less digits than its factorization.
120211120210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12021112028.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120211120210 its reverse (12021112021), we get a palindrome (132232232231).
The spelling of 120211120210 in words is "one hundred twenty billion, two hundred eleven million, one hundred twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •