Base | Representation |
---|---|
bin | 10111010011100100100110… |
… | …10111000001010000001010 |
3 | 20201110110021011012100211200 |
4 | 23221302103113001100022 |
5 | 23204140021121423231 |
6 | 300555533552205030 |
7 | 13536456215551653 |
oct | 1351622327012012 |
9 | 221413234170750 |
10 | 51250022061066 |
11 | 1536a015406014 |
12 | 58b8720839776 |
13 | 2279b19502c8a |
14 | c9272b36652a |
15 | 5dd1e60ebbe6 |
hex | 2e9c935c140a |
51250022061066 has 72 divisors (see below), whose sum is σ = 118097086345056. Its totient is φ = 16032273422880.
The previous prime is 51250022061061. The next prime is 51250022061083. The reversal of 51250022061066 is 66016022005215.
51250022061066 is a `hidden beast` number, since 5 + 12 + 5 + 0 + 0 + 2 + 20 + 610 + 6 + 6 = 666.
It is a super-2 number, since 2×512500220610662 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51250022061066.
It is not an unprimeable number, because it can be changed into a prime (51250022061061) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 20872020 + ... + 23197871.
It is an arithmetic number, because the mean of its divisors is an integer number (1640237310348).
Almost surely, 251250022061066 is an apocalyptic number.
51250022061066 is an abundant number, since it is smaller than the sum of its proper divisors (66847064283990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51250022061066 is a wasteful number, since it uses less digits than its factorization.
51250022061066 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44070028 (or 44069972 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The spelling of 51250022061066 in words is "fifty-one trillion, two hundred fifty billion, twenty-two million, sixty-one thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •