Base | Representation |
---|---|
bin | 11011010010011001111111… |
… | …110110100101100101110011 |
3 | 120201221001021001221211211020 |
4 | 123102121333312211211303 |
5 | 111212234311011413021 |
6 | 1103124450220150523 |
7 | 34164406145533464 |
oct | 3322317766454563 |
9 | 521831231854736 |
10 | 120012121201011 |
11 | 3526a944787a06 |
12 | 115631a0698443 |
13 | 51c712c718c70 |
14 | 218c890bdad6b |
15 | dd1bcd8677c6 |
hex | 6d267fda5973 |
120012121201011 has 16 divisors (see below), whose sum is σ = 172326087425184. Its totient is φ = 73853188625664.
The previous prime is 120012121200973. The next prime is 120012121201013. The reversal of 120012121201011 is 110102121210021.
It is a happy number.
It is not a de Polignac number, because 120012121201011 - 230 = 120011047459187 is a prime.
It is a super-3 number, since 3×1200121212010113 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (120012121201013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1899706 + ... + 15608751.
It is an arithmetic number, because the mean of its divisors is an integer number (10770380464074).
Almost surely, 2120012121201011 is an apocalyptic number.
120012121201011 is a deficient number, since it is larger than the sum of its proper divisors (52313966224173).
120012121201011 is a wasteful number, since it uses less digits than its factorization.
120012121201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17684230.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 120012121201011 its reverse (110102121210021), we get a palindrome (230114242411032).
The spelling of 120012121201011 in words is "one hundred twenty trillion, twelve billion, one hundred twenty-one million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •