Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …0011100010101001001101 |
3 | 1022210111200222110210121012 |
4 | 2103013223203202221031 |
5 | 2311120300030311224 |
6 | 33300250253215005 |
7 | 2062265321116055 |
oct | 223075343425115 |
9 | 38714628423535 |
10 | 10110010010189 |
11 | 32486a40a0a11 |
12 | 1173479a91465 |
13 | 5844a674b7cb |
14 | 26d48179a565 |
15 | 127eb7d6680e |
hex | 931eb8e2a4d |
10110010010189 has 2 divisors, whose sum is σ = 10110010010190. Its totient is φ = 10110010010188.
The previous prime is 10110010010161. The next prime is 10110010010201. The reversal of 10110010010189 is 98101001001101.
10110010010189 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9866697676900 + 243312333289 = 3141130^2 + 493267^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110010010189 - 232 = 10105715042893 is a prime.
It is a super-2 number, since 2×101100100101892 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110010010129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055005005094 + 5055005005095.
It is an arithmetic number, because the mean of its divisors is an integer number (5055005005095).
Almost surely, 210110010010189 is an apocalyptic number.
It is an amenable number.
10110010010189 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110010010189 is an equidigital number, since it uses as much as digits as its factorization.
10110010010189 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 23.
The spelling of 10110010010189 in words is "ten trillion, one hundred ten billion, ten million, ten thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •