Base | Representation |
---|---|
bin | 101111110001101001100111… |
… | …001110110110011001110011 |
3 | 1000112222021202120121012211012 |
4 | 233301221213032312121303 |
5 | 210020102002213013021 |
6 | 2022515503525541135 |
7 | 62154451334101445 |
oct | 5761514716663163 |
9 | 1015867676535735 |
10 | 210120122001011 |
11 | 60a5049705a672 |
12 | 1b69682b8747ab |
13 | 903231c9793c1 |
14 | 39c5c22376495 |
15 | 1945a8ea3635b |
hex | bf1a673b6673 |
210120122001011 has 8 divisors (see below), whose sum is σ = 213565053240048. Its totient is φ = 206675201700000.
The previous prime is 210120122001007. The next prime is 210120122001017. The reversal of 210120122001011 is 110100221021012.
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 210120122001011 - 22 = 210120122001007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210120122001017) 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, 41933036 + ... + 46675686.
It is an arithmetic number, because the mean of its divisors is an integer number (26695631655006).
Almost surely, 2210120122001011 is an apocalyptic number.
210120122001011 is a deficient number, since it is larger than the sum of its proper divisors (3444931239037).
210120122001011 is an equidigital number, since it uses as much as digits as its factorization.
210120122001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5469013.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 210120122001011 its reverse (110100221021012), we get a palindrome (320220343022023).
The spelling of 210120122001011 in words is "two hundred ten trillion, one hundred twenty billion, one hundred twenty-two million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •