Base | Representation |
---|---|
bin | 11011010011101100111110… |
… | …100111110100000010100101 |
3 | 120202020120020121011210221210 |
4 | 123103230332213310002211 |
5 | 111220214300101402323 |
6 | 1103233423404502033 |
7 | 34204012135422552 |
oct | 3323547647640245 |
9 | 522216217153853 |
10 | 120101221122213 |
11 | 352a4707322521 |
12 | 11578507b4a919 |
13 | 520265bc17a26 |
14 | 2192d0435ba29 |
15 | dd4195b9e293 |
hex | 6d3b3e9f40a5 |
120101221122213 has 16 divisors (see below), whose sum is σ = 164707306389056. Its totient is φ = 77787739169280.
The previous prime is 120101221122167. The next prime is 120101221122227. The reversal of 120101221122213 is 312221122101021.
It is not a de Polignac number, because 120101221122213 - 212 = 120101221118117 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 120101221122213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120101221122613) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 803783383 + ... + 803932788.
It is an arithmetic number, because the mean of its divisors is an integer number (10294206649316).
Almost surely, 2120101221122213 is an apocalyptic number.
It is an amenable number.
120101221122213 is a deficient number, since it is larger than the sum of its proper divisors (44606085266843).
120101221122213 is a wasteful number, since it uses less digits than its factorization.
120101221122213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1607716884.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 120101221122213 its reverse (312221122101021), we get a palindrome (432322343223234).
The spelling of 120101221122213 in words is "one hundred twenty trillion, one hundred one billion, two hundred twenty-one million, one hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •