Base | Representation |
---|---|
bin | 11011010101001001111010… |
… | …101000001110011010100011 |
3 | 120202121002211012112021201212 |
4 | 123111021322220032122203 |
5 | 111223333133100023021 |
6 | 1103351325504020335 |
7 | 34214144064013136 |
oct | 3325117250163243 |
9 | 522532735467655 |
10 | 120201012111011 |
11 | 35332a65780397 |
12 | 115939179016ab |
13 | 520bba33366b0 |
14 | 2197a8d73221d |
15 | dd6a8689e85b |
hex | 6d527aa0e6a3 |
120201012111011 has 8 divisors (see below), whose sum is σ = 133622961354624. Its totient is φ = 107375593944960.
The previous prime is 120201012110999. The next prime is 120201012111077. The reversal of 120201012111011 is 110111210102021.
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 120201012111011 - 214 = 120201012094627 is a prime.
It is a super-2 number, since 2×1202010121110112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120201012111091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 149132768966 + ... + 149132769771.
It is an arithmetic number, because the mean of its divisors is an integer number (16702870169328).
Almost surely, 2120201012111011 is an apocalyptic number.
120201012111011 is a deficient number, since it is larger than the sum of its proper divisors (13421949243613).
120201012111011 is a wasteful number, since it uses less digits than its factorization.
120201012111011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 298265538781.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 120201012111011 its reverse (110111210102021), we get a palindrome (230312222213032).
The spelling of 120201012111011 in words is "one hundred twenty trillion, two hundred one billion, twelve million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •