Base | Representation |
---|---|
bin | 11011010011101100110010… |
… | …101001000001010010001011 |
3 | 120202020112201120221102210111 |
4 | 123103230302221001102023 |
5 | 111220213342122041021 |
6 | 1103233351424255151 |
7 | 34204004145030151 |
oct | 3323546251012213 |
9 | 522215646842714 |
10 | 120101020112011 |
11 | 352a461390a594 |
12 | 115784707714b7 |
13 | 5202629398993 |
14 | 2192cc57953d1 |
15 | dd41831e58e1 |
hex | 6d3b32a4148b |
120101020112011 has 8 divisors (see below), whose sum is σ = 121267331550864. Its totient is φ = 118936523946240.
The previous prime is 120101020111957. The next prime is 120101020112063. The reversal of 120101020112011 is 110211020101021.
It is a happy number.
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 120101020112011 - 223 = 120101011723403 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120101020111982 and 120101020112000.
It is not an unprimeable number, because it can be changed into a prime (120101020112071) 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, 453685306 + ... + 453949951.
It is an arithmetic number, because the mean of its divisors is an integer number (15158416443858).
Almost surely, 2120101020112011 is an apocalyptic number.
120101020112011 is a deficient number, since it is larger than the sum of its proper divisors (1166311438853).
120101020112011 is a wasteful number, since it uses less digits than its factorization.
120101020112011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 907636541.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 120101020112011 its reverse (110211020101021), we get a palindrome (230312040213032).
The spelling of 120101020112011 in words is "one hundred twenty trillion, one hundred one billion, twenty million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •