Base | Representation |
---|---|
bin | 10111001110001110111000… |
… | …01111000011001111011101 |
3 | 20200210220201110001200021010 |
4 | 23213013130033003033131 |
5 | 23143133304121140401 |
6 | 300335353155325433 |
7 | 13520302663340250 |
oct | 1347073417031735 |
9 | 220726643050233 |
10 | 51066561115101 |
11 | 152a92304a0a14 |
12 | 588905bbb0879 |
13 | 226572c84720c |
14 | c878c5a57097 |
15 | 5d8559b4ced6 |
hex | 2e71dc3c33dd |
51066561115101 has 32 divisors (see below), whose sum is σ = 78855467680000. Its totient is φ = 28793205457920.
The previous prime is 51066561115039. The next prime is 51066561115103. The reversal of 51066561115101 is 10151116566015.
It is not a de Polignac number, because 51066561115101 - 29 = 51066561114589 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 51066561115101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51066561115103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45733726 + ... + 46837023.
It is an arithmetic number, because the mean of its divisors is an integer number (2464233365000).
Almost surely, 251066561115101 is an apocalyptic number.
It is an amenable number.
51066561115101 is a deficient number, since it is larger than the sum of its proper divisors (27788906564899).
51066561115101 is a wasteful number, since it uses less digits than its factorization.
51066561115101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92571109.
The product of its (nonzero) digits is 27000, while the sum is 39.
The spelling of 51066561115101 in words is "fifty-one trillion, sixty-six billion, five hundred sixty-one million, one hundred fifteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •