Base | Representation |
---|---|
bin | 11011010011101100110001… |
… | …100100110001011000110111 |
3 | 120202020112200100021111002120 |
4 | 123103230301210301120313 |
5 | 111220213323032033421 |
6 | 1103233345545011023 |
7 | 34204003536664122 |
oct | 3323546144613067 |
9 | 522215610244076 |
10 | 120101002221111 |
11 | 352a46047aa91a |
12 | 11578466783a73 |
13 | 5202625773552 |
14 | 2192cc32593b9 |
15 | dd418185e8c6 |
hex | 6d3b31931637 |
120101002221111 has 8 divisors (see below), whose sum is σ = 164462633672304. Its totient is φ = 77903352792000.
The previous prime is 120101002221091. The next prime is 120101002221127. The reversal of 120101002221111 is 111122200101021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120101002221111 - 26 = 120101002221047 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120101002221181) 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, 540995505390 + ... + 540995505611.
It is an arithmetic number, because the mean of its divisors is an integer number (20557829209038).
Almost surely, 2120101002221111 is an apocalyptic number.
120101002221111 is a deficient number, since it is larger than the sum of its proper divisors (44361631451193).
120101002221111 is a wasteful number, since it uses less digits than its factorization.
120101002221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1081991011041.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 120101002221111 its reverse (111122200101021), we get a palindrome (231223202322132).
The spelling of 120101002221111 in words is "one hundred twenty trillion, one hundred one billion, two million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •