Base | Representation |
---|---|
bin | 1100001110110000100… |
… | …0101001011100110001 |
3 | 202002100122002001102212 |
4 | 3003230020221130301 |
5 | 11420311222320423 |
6 | 240310003221505 |
7 | 21115654360241 |
oct | 3035410513461 |
9 | 662318061385 |
10 | 210120120113 |
11 | 8112536a232 |
12 | 34880977895 |
13 | 16a77b76127 |
14 | a254191b21 |
15 | 56ebb5d578 |
hex | 30ec229731 |
210120120113 has 8 divisors (see below), whose sum is σ = 213575325096. Its totient is φ = 206665257600.
The previous prime is 210120120079. The next prime is 210120120143. The reversal of 210120120113 is 311021021012.
It can be written as a sum of positive squares in 4 ways, for example, as 128890609 + 209991229504 = 11353^2 + 458248^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210120120113 - 28 = 210120119857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210120120143) 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 7 ways as a sum of consecutive naturals, for example, 1346933 + ... + 1494813.
It is an arithmetic number, because the mean of its divisors is an integer number (26696915637).
Almost surely, 2210120120113 is an apocalyptic number.
It is an amenable number.
210120120113 is a deficient number, since it is larger than the sum of its proper divisors (3455204983).
210120120113 is a wasteful number, since it uses less digits than its factorization.
210120120113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171235.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 210120120113 its reverse (311021021012), we get a palindrome (521141141125).
The spelling of 210120120113 in words is "two hundred ten billion, one hundred twenty million, one hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •