Base | Representation |
---|---|
bin | 11011010010011010001010… |
… | …101001011101101011101001 |
3 | 120201221001201200202010211001 |
4 | 123102122022221131223221 |
5 | 111212240143342410441 |
6 | 1103124520210035001 |
7 | 34164413505121414 |
oct | 3322321251355351 |
9 | 521831650663731 |
10 | 120012302310121 |
11 | 3526aa27a37961 |
12 | 11563231278a61 |
13 | 51c715b0ba910 |
14 | 218c8aaca2b7b |
15 | dd1bde6de731 |
hex | 6d268aa5dae9 |
120012302310121 has 16 divisors (see below), whose sum is σ = 136849239450000. Its totient is φ = 104262076090368.
The previous prime is 120012302310077. The next prime is 120012302310139. The reversal of 120012302310121 is 121013203210021.
It can be written as a sum of positive squares in 8 ways, for example, as 57125419794496 + 62886882515625 = 7558136^2 + 7930125^2 .
It is a cyclic number.
It is not a de Polignac number, because 120012302310121 - 219 = 120012301785833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120012302310161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6350355 + ... + 16743703.
It is an arithmetic number, because the mean of its divisors is an integer number (8553077465625).
Almost surely, 2120012302310121 is an apocalyptic number.
It is an amenable number.
120012302310121 is a deficient number, since it is larger than the sum of its proper divisors (16836937139879).
120012302310121 is a wasteful number, since it uses less digits than its factorization.
120012302310121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10445628.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 120012302310121 its reverse (121013203210021), we get a palindrome (241025505520142).
The spelling of 120012302310121 in words is "one hundred twenty trillion, twelve billion, three hundred two million, three hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •