Base | Representation |
---|---|
bin | 1001010001110010000110… |
… | …0010111000111001111111 |
3 | 1100010012211220101222120112 |
4 | 2110130201202320321333 |
5 | 2314113333142401421 |
6 | 33410154132540235 |
7 | 2102002006233026 |
oct | 224344142707177 |
9 | 40105756358515 |
10 | 10201110122111 |
11 | 32832a27a3407 |
12 | 118906318167b |
13 | 58cc6446068c |
14 | 273a448258bd |
15 | 12a54aa9c45b |
hex | 947218b8e7f |
10201110122111 has 4 divisors (see below), whose sum is σ = 10201220638824. Its totient is φ = 10200999605400.
The previous prime is 10201110122107. The next prime is 10201110122113. The reversal of 10201110122111 is 11122101110201.
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 10201110122111 - 22 = 10201110122107 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201110122113) 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 3 ways as a sum of consecutive naturals, for example, 55119785 + ... + 55304546.
It is an arithmetic number, because the mean of its divisors is an integer number (2550305159706).
Almost surely, 210201110122111 is an apocalyptic number.
10201110122111 is a deficient number, since it is larger than the sum of its proper divisors (110516713).
10201110122111 is an equidigital number, since it uses as much as digits as its factorization.
10201110122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110516712.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10201110122111 its reverse (11122101110201), we get a palindrome (21323211232312).
The spelling of 10201110122111 in words is "ten trillion, two hundred one billion, one hundred ten million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •