Base | Representation |
---|---|
bin | 11011010011101100110010… |
… | …101000111110100111110111 |
3 | 120202020112201120220212211210 |
4 | 123103230302220332213313 |
5 | 111220213342121213421 |
6 | 1103233351424132503 |
7 | 34204004144653320 |
oct | 3323546250764767 |
9 | 522215646825753 |
10 | 120101020101111 |
11 | 352a4613902385 |
12 | 11578470767133 |
13 | 5202629393a2a |
14 | 2192cc5791447 |
15 | dd41831e2576 |
hex | 6d3b32a3e9f7 |
120101020101111 has 64 divisors (see below), whose sum is σ = 191227626455040. Its totient is φ = 65556119059200.
The previous prime is 120101020101107. The next prime is 120101020101119. The reversal of 120101020101111 is 111101020101021.
It is not a de Polignac number, because 120101020101111 - 22 = 120101020101107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120101020101119) 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 63 ways as a sum of consecutive naturals, for example, 1095127866 + ... + 1095237528.
It is an arithmetic number, because the mean of its divisors is an integer number (2987931663360).
Almost surely, 2120101020101111 is an apocalyptic number.
120101020101111 is a deficient number, since it is larger than the sum of its proper divisors (71126606353929).
120101020101111 is a wasteful number, since it uses less digits than its factorization.
120101020101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112756.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 120101020101111 its reverse (111101020101021), we get a palindrome (231202040202132).
The spelling of 120101020101111 in words is "one hundred twenty trillion, one hundred one billion, twenty million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •