Base | Representation |
---|---|
bin | 1001001100101001111001… |
… | …1111010001000010110101 |
3 | 1022210210110012021020210102 |
4 | 2103022132133101002311 |
5 | 2311142422033324224 |
6 | 33301504212403445 |
7 | 2062432602524423 |
oct | 223123637210265 |
9 | 38723405236712 |
10 | 10113012011189 |
11 | 32499a46a877a |
12 | 1173b77316585 |
13 | 584864683a69 |
14 | 26d688364113 |
15 | 1280e16a34ae |
hex | 9329e7d10b5 |
10113012011189 has 2 divisors, whose sum is σ = 10113012011190. Its totient is φ = 10113012011188.
The previous prime is 10113012011183. The next prime is 10113012011243. The reversal of 10113012011189 is 98111021031101.
10113012011189 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5668327680625 + 4444684330564 = 2380825^2 + 2108242^2 .
It is a cyclic number.
It is not a de Polignac number, because 10113012011189 - 236 = 10044292534453 is a prime.
It is a super-2 number, since 2×101130120111892 (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 (10113012011183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056506005594 + 5056506005595.
It is an arithmetic number, because the mean of its divisors is an integer number (5056506005595).
Almost surely, 210113012011189 is an apocalyptic number.
It is an amenable number.
10113012011189 is a deficient number, since it is larger than the sum of its proper divisors (1).
10113012011189 is an equidigital number, since it uses as much as digits as its factorization.
10113012011189 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 29.
The spelling of 10113012011189 in words is "ten trillion, one hundred thirteen billion, twelve million, eleven thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •