Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …0011101101100001111111 |
3 | 1022102221211210012200002110 |
4 | 2101222221003231201333 |
5 | 2303001201142401421 |
6 | 33142325304025103 |
7 | 2052130601100051 |
oct | 221525103554177 |
9 | 38387753180073 |
10 | 10010110122111 |
11 | 320a29a223440 |
12 | 1158039762193 |
13 | 577c458c17b8 |
14 | 2686c5b598d1 |
15 | 1255bc804a76 |
hex | 91aa90ed87f |
10010110122111 has 16 divisors (see below), whose sum is σ = 15416640188928. Its totient is φ = 5709866736000.
The previous prime is 10010110122073. The next prime is 10010110122119. The reversal of 10010110122111 is 11122101101001.
It is not a de Polignac number, because 10010110122111 - 210 = 10010110121087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010110122119) 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 15 ways as a sum of consecutive naturals, for example, 8921666215 + ... + 8921667336.
It is an arithmetic number, because the mean of its divisors is an integer number (963540011808).
Almost surely, 210010110122111 is an apocalyptic number.
10010110122111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10010110122111 is a deficient number, since it is larger than the sum of its proper divisors (5406530066817).
10010110122111 is a wasteful number, since it uses less digits than its factorization.
10010110122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17843333582.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10010110122111 its reverse (11122101101001), we get a palindrome (21132211223112).
The spelling of 10010110122111 in words is "ten trillion, ten billion, one hundred ten million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •