Base | Representation |
---|---|
bin | 11011010010010000101011… |
… | …101111000100100111100011 |
3 | 120201220002110001221201020011 |
4 | 123102100223233010213203 |
5 | 111212103320210311321 |
6 | 1103120113552025351 |
7 | 34163603255032015 |
oct | 3322205357044743 |
9 | 521802401851204 |
10 | 120002120010211 |
11 | 3526668232a26a |
12 | 1156126b232257 |
13 | 51c61c770279a |
14 | 218c1c28481b5 |
15 | dd17e5821ae1 |
hex | 6d242bbc49e3 |
120002120010211 has 4 divisors (see below), whose sum is σ = 126318021063400. Its totient is φ = 113686218957024.
The previous prime is 120002120010203. The next prime is 120002120010271. The reversal of 120002120010211 is 112010021200021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120002120010211 - 23 = 120002120010203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120002120010191 and 120002120010200.
It is not an unprimeable number, because it can be changed into a prime (120002120010271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3157950526566 + ... + 3157950526603.
It is an arithmetic number, because the mean of its divisors is an integer number (31579505265850).
Almost surely, 2120002120010211 is an apocalyptic number.
120002120010211 is a deficient number, since it is larger than the sum of its proper divisors (6315901053189).
120002120010211 is an equidigital number, since it uses as much as digits as its factorization.
120002120010211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6315901053188.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 120002120010211 its reverse (112010021200021), we get a palindrome (232012141210232).
The spelling of 120002120010211 in words is "one hundred twenty trillion, two billion, one hundred twenty million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •