Base | Representation |
---|---|
bin | 1001001100100011001111… |
… | …0011010101101111100001 |
3 | 1022210121211110020220121021 |
4 | 2103020303303111233201 |
5 | 2311130240330024301 |
6 | 33301010432525441 |
7 | 2062340336604211 |
oct | 223106363255741 |
9 | 38717743226537 |
10 | 10111222111201 |
11 | 3249166312392 |
12 | 11737579b0881 |
13 | 58463a8bbc43 |
14 | 26d55875a241 |
15 | 1280394928a1 |
hex | 93233cd5be1 |
10111222111201 has 8 divisors (see below), whose sum is σ = 10377171451584. Its totient is φ = 9848704375440.
The previous prime is 10111222111141. The next prime is 10111222111241. The reversal of 10111222111201 is 10211122211101.
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 10111222111201 - 27 = 10111222111073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10111222111241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 857895186 + ... + 857906971.
It is an arithmetic number, because the mean of its divisors is an integer number (1297146431448).
Almost surely, 210111222111201 is an apocalyptic number.
It is an amenable number.
10111222111201 is a deficient number, since it is larger than the sum of its proper divisors (265949340383).
10111222111201 is an equidigital number, since it uses as much as digits as its factorization.
10111222111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1715802311.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 10111222111201 its reverse (10211122211101), we get a palindrome (20322344322302).
The spelling of 10111222111201 in words is "ten trillion, one hundred eleven billion, two hundred twenty-two million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •