Base | Representation |
---|---|
bin | 10111001111011011101101… |
… | …00100010001100001001010 |
3 | 20200221212011210211221200002 |
4 | 23213231312210101201022 |
5 | 23144322241044404110 |
6 | 300410333532443002 |
7 | 13523263024250660 |
oct | 1347556644214112 |
9 | 220855153757602 |
10 | 51107805075530 |
11 | 15314775650925 |
12 | 5895050619462 |
13 | 22695a3543328 |
14 | c898b9518c30 |
15 | 5d9670955aa5 |
hex | 2e7b7691184a |
51107805075530 has 32 divisors (see below), whose sum is σ = 107372993527296. Its totient is φ = 17149853130624.
The previous prime is 51107805075499. The next prime is 51107805075557. The reversal of 51107805075530 is 3557050870115.
51107805075530 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×511078050755302 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7767140339 + ... + 7767146918.
It is an arithmetic number, because the mean of its divisors is an integer number (3355406047728).
Almost surely, 251107805075530 is an apocalyptic number.
51107805075530 is an abundant number, since it is smaller than the sum of its proper divisors (56265188451766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51107805075530 is a wasteful number, since it uses less digits than its factorization.
51107805075530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15534287318.
The product of its (nonzero) digits is 735000, while the sum is 47.
The spelling of 51107805075530 in words is "fifty-one trillion, one hundred seven billion, eight hundred five million, seventy-five thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •