Base | Representation |
---|---|
bin | 11011010101011101011101… |
… | …101110010101110001001011 |
3 | 120202200010000000201200202222 |
4 | 123111131131232111301023 |
5 | 111224204130003324321 |
6 | 1103405120354244255 |
7 | 34215516166144352 |
oct | 3325353556256113 |
9 | 522603000650688 |
10 | 120222002011211 |
11 | 35340956a55051 |
12 | 115979b528668b |
13 | 5210b69b23399 |
14 | 2198ac1296999 |
15 | dd73b44a43ab |
hex | 6d575db95c4b |
120222002011211 has 8 divisors (see below), whose sum is σ = 120351309697440. Its totient is φ = 120092754798208.
The previous prime is 120222002011201. The next prime is 120222002011229. The reversal of 120222002011211 is 112110200222021.
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 120222002011211 - 26 = 120222002011147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120222002011211.
It is not an unprimeable number, because it can be changed into a prime (120222002011201) 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, 11139566 + ... + 19092771.
It is an arithmetic number, because the mean of its divisors is an integer number (15043913712180).
Almost surely, 2120222002011211 is an apocalyptic number.
120222002011211 is a deficient number, since it is larger than the sum of its proper divisors (129307686229).
120222002011211 is a wasteful number, since it uses less digits than its factorization.
120222002011211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30236613.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 120222002011211 its reverse (112110200222021), we get a palindrome (232332202233232).
The spelling of 120222002011211 in words is "one hundred twenty trillion, two hundred twenty-two billion, two million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •