Base | Representation |
---|---|
bin | 100101001001010000001… |
… | …0101010111111000100101 |
3 | 200002001011222012111201100 |
4 | 1022102200111113320211 |
5 | 1132120231420330221 |
6 | 14505131120150313 |
7 | 1034555261261442 |
oct | 112224025277045 |
9 | 20061158174640 |
10 | 5105111105061 |
11 | 169907a146530 |
12 | 6a54a3468399 |
13 | 2b0543763916 |
14 | 13913554a9c9 |
15 | 8cbe050c926 |
hex | 4a4a0557e25 |
5105111105061 has 12 divisors (see below), whose sum is σ = 8044417499040. Its totient is φ = 3094006730280.
The previous prime is 5105111105057. The next prime is 5105111105069. The reversal of 5105111105061 is 1605011115015.
It is not a de Polignac number, because 5105111105061 - 22 = 5105111105057 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105111105069) 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 11 ways as a sum of consecutive naturals, for example, 25783389321 + ... + 25783389518.
It is an arithmetic number, because the mean of its divisors is an integer number (670368124920).
Almost surely, 25105111105061 is an apocalyptic number.
It is an amenable number.
5105111105061 is a deficient number, since it is larger than the sum of its proper divisors (2939306393979).
5105111105061 is a wasteful number, since it uses less digits than its factorization.
5105111105061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51566778856 (or 51566778853 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 27.
The spelling of 5105111105061 in words is "five trillion, one hundred five billion, one hundred eleven million, one hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •