Base | Representation |
---|---|
bin | 10010111001011101… |
… | …10011010001100111 |
3 | 222012001221022201001 |
4 | 21130232303101213 |
5 | 131234300111421 |
6 | 4354425414131 |
7 | 506264042011 |
oct | 113456632147 |
9 | 28161838631 |
10 | 10145707111 |
11 | 4336a94a11 |
12 | 1b7193a347 |
13 | c58c453b7 |
14 | 6c36511b1 |
15 | 3e5a90691 |
hex | 25cbb3467 |
10145707111 has 16 divisors (see below), whose sum is σ = 10645367040. Its totient is φ = 9658514880.
The previous prime is 10145707109. The next prime is 10145707129. The reversal of 10145707111 is 11170754101.
It is a cyclic number.
It is not a de Polignac number, because 10145707111 - 21 = 10145707109 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10145707111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10145707141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2323216 + ... + 2327578.
It is an arithmetic number, because the mean of its divisors is an integer number (665335440).
Almost surely, 210145707111 is an apocalyptic number.
10145707111 is a deficient number, since it is larger than the sum of its proper divisors (499659929).
10145707111 is a wasteful number, since it uses less digits than its factorization.
10145707111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5766.
The product of its (nonzero) digits is 980, while the sum is 28.
The spelling of 10145707111 in words is "ten billion, one hundred forty-five million, seven hundred seven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •