Base | Representation |
---|---|
bin | 10010101110000011… |
… | …01111111111111011 |
3 | 221221101212110111111 |
4 | 21113001233333323 |
5 | 131040300324011 |
6 | 4341130341151 |
7 | 504022453666 |
oct | 112701577773 |
9 | 27841773444 |
10 | 10050011131 |
11 | 4297a73126 |
12 | 1b4588a7b7 |
13 | c4217a964 |
14 | 6b4a606dd |
15 | 3dc48b121 |
hex | 25706fffb |
10050011131 has 8 divisors (see below), whose sum is σ = 10102278384. Its totient is φ = 9997831680.
The previous prime is 10050011129. The next prime is 10050011137. The reversal of 10050011131 is 13111005001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10050011131 - 21 = 10050011129 is a prime.
It is a super-2 number, since 2×100500111312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10050011137) 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 7 ways as a sum of consecutive naturals, for example, 214116 + ... + 256798.
It is an arithmetic number, because the mean of its divisors is an integer number (1262784798).
Almost surely, 210050011131 is an apocalyptic number.
10050011131 is a deficient number, since it is larger than the sum of its proper divisors (52267253).
10050011131 is an equidigital number, since it uses as much as digits as its factorization.
10050011131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43901.
The product of its (nonzero) digits is 15, while the sum is 13.
Adding to 10050011131 its reverse (13111005001), we get a palindrome (23161016132).
The spelling of 10050011131 in words is "ten billion, fifty million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •