Base | Representation |
---|---|
bin | 1001001001000001101000… |
… | …1001010100001001111111 |
3 | 1022120211111220221201020101 |
4 | 2102100122021110021333 |
5 | 2304132224000401421 |
6 | 33213113242101531 |
7 | 2055064530312232 |
oct | 222203211241177 |
9 | 38524456851211 |
10 | 10050662122111 |
11 | 3225509825226 |
12 | 1163a764aa8a7 |
13 | 57ba09134980 |
14 | 26a651777419 |
15 | 1266929c7191 |
hex | 9241a25427f |
10050662122111 has 16 divisors (see below), whose sum is σ = 11294605808640. Its totient is φ = 8873993288160.
The previous prime is 10050662122091. The next prime is 10050662122159. The reversal of 10050662122111 is 11122126605001.
It is not a de Polignac number, because 10050662122111 - 25 = 10050662122079 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 10050662122111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10050662120111) 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, 16848810 + ... + 17435128.
It is an arithmetic number, because the mean of its divisors is an integer number (705912863040).
Almost surely, 210050662122111 is an apocalyptic number.
10050662122111 is a deficient number, since it is larger than the sum of its proper divisors (1243943686529).
10050662122111 is a wasteful number, since it uses less digits than its factorization.
10050662122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 643686.
The product of its (nonzero) digits is 1440, while the sum is 28.
Adding to 10050662122111 its reverse (11122126605001), we get a palindrome (21172788727112).
The spelling of 10050662122111 in words is "ten trillion, fifty billion, six hundred sixty-two million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •