Base | Representation |
---|---|
bin | 11011010010010000110000… |
… | …101001000100000100111011 |
3 | 120201220002122210211112200201 |
4 | 123102100300221010010323 |
5 | 111212104002243234321 |
6 | 1103120130052143031 |
7 | 34163605304461540 |
oct | 3322206051040473 |
9 | 521802583745621 |
10 | 120002202321211 |
11 | 35266714839791 |
12 | 11561292907a77 |
13 | 51c620b791a12 |
14 | 218c1cd752bc7 |
15 | dd17ecb80291 |
hex | 6d2430a4413b |
120002202321211 has 8 divisors (see below), whose sum is σ = 137151457985024. Its totient is φ = 102854467633320.
The previous prime is 120002202321187. The next prime is 120002202321227. The reversal of 120002202321211 is 112123202200021.
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 120002202321211 - 211 = 120002202319163 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120002202321271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 380074905 + ... + 380390506.
It is an arithmetic number, because the mean of its divisors is an integer number (17143932248128).
Almost surely, 2120002202321211 is an apocalyptic number.
120002202321211 is a deficient number, since it is larger than the sum of its proper divisors (17149255663813).
120002202321211 is an equidigital number, since it uses as much as digits as its factorization.
120002202321211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 760487961.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 120002202321211 its reverse (112123202200021), we get a palindrome (232125404521232).
The spelling of 120002202321211 in words is "one hundred twenty trillion, two billion, two hundred two million, three hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •