Base | Representation |
---|---|
bin | 1001001001000011010010… |
… | …0100111001101000010111 |
3 | 1022120212122211100202012001 |
4 | 2102100310210321220113 |
5 | 2304134131010423421 |
6 | 33213225242340131 |
7 | 2055111523424266 |
oct | 222206444715027 |
9 | 38525584322161 |
10 | 10051105561111 |
11 | 322571706a53a |
12 | 1163b7aaba647 |
13 | 57ba79c75204 |
14 | 26a6946085dd |
15 | 1266bb8bb691 |
hex | 92434939a17 |
10051105561111 has 16 divisors (see below), whose sum is σ = 10186412651584. Its totient is φ = 9916531640064.
The previous prime is 10051105561069. The next prime is 10051105561139. The reversal of 10051105561111 is 11116550115001.
It is a cyclic number.
It is not a de Polignac number, because 10051105561111 - 211 = 10051105559063 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 10051105561111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10051105561141) 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, 522478585 + ... + 522497821.
It is an arithmetic number, because the mean of its divisors is an integer number (636650790724).
Almost surely, 210051105561111 is an apocalyptic number.
10051105561111 is a deficient number, since it is larger than the sum of its proper divisors (135307090473).
10051105561111 is a wasteful number, since it uses less digits than its factorization.
10051105561111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37930.
The product of its (nonzero) digits is 750, while the sum is 28.
Adding to 10051105561111 its reverse (11116550115001), we get a palindrome (21167655676112).
The spelling of 10051105561111 in words is "ten trillion, fifty-one billion, one hundred five million, five hundred sixty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •