Base | Representation |
---|---|
bin | 11011010101011101011101… |
… | …101110010011010011010111 |
3 | 120202200010000000201011220220 |
4 | 123111131131232103103113 |
5 | 111224204130003013421 |
6 | 1103405120354125423 |
7 | 34215516166103043 |
oct | 3325353556232327 |
9 | 522603000634826 |
10 | 120222002001111 |
11 | 35340956a484aa |
12 | 115979b5280873 |
13 | 5210b69b1b8ca |
14 | 2198ac1293023 |
15 | dd73b44a13c6 |
hex | 6d575db934d7 |
120222002001111 has 8 divisors (see below), whose sum is σ = 160314362112384. Its totient is φ = 80138821611960.
The previous prime is 120222002001103. The next prime is 120222002001113. The reversal of 120222002001111 is 111100200222021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120222002001111 - 23 = 120222002001103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120222002001113) 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 7 ways as a sum of consecutive naturals, for example, 2294899971 + ... + 2294952356.
It is an arithmetic number, because the mean of its divisors is an integer number (20039295264048).
Almost surely, 2120222002001111 is an apocalyptic number.
120222002001111 is a deficient number, since it is larger than the sum of its proper divisors (40092360111273).
120222002001111 is an equidigital number, since it uses as much as digits as its factorization.
120222002001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4589861061.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120222002001111 its reverse (111100200222021), we get a palindrome (231322202223132).
The spelling of 120222002001111 in words is "one hundred twenty trillion, two hundred twenty-two billion, two million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •