Base | Representation |
---|---|
bin | 10110111110000010011010… |
… | …01100100111111101100001 |
3 | 20121211201102110011102211110 |
4 | 23133001031030213331201 |
5 | 23110024201300243001 |
6 | 255232005140533533 |
7 | 13432143424541235 |
oct | 1337011514477541 |
9 | 217751373142743 |
10 | 50510110556001 |
11 | 15104243681998 |
12 | 57b92459b12a9 |
13 | 2225110429665 |
14 | c689b952c5c5 |
15 | 5c8d3d1dd3d6 |
hex | 2df04d327f61 |
50510110556001 has 16 divisors (see below), whose sum is σ = 68296661516160. Its totient is φ = 33198501383040.
The previous prime is 50510110555997. The next prime is 50510110556021. The reversal of 50510110556001 is 10065501101505.
It is not a de Polignac number, because 50510110556001 - 22 = 50510110555997 is a prime.
It is a super-2 number, since 2×505101105560012 (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 50510110556001.
It is not an unprimeable number, because it can be changed into a prime (50510110556021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9084771 + ... + 13548183.
It is an arithmetic number, because the mean of its divisors is an integer number (4268541344760).
Almost surely, 250510110556001 is an apocalyptic number.
It is an amenable number.
50510110556001 is a deficient number, since it is larger than the sum of its proper divisors (17786550960159).
50510110556001 is a wasteful number, since it uses less digits than its factorization.
50510110556001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4516616.
The product of its (nonzero) digits is 3750, while the sum is 30.
Adding to 50510110556001 its reverse (10065501101505), we get a palindrome (60575611657506).
The spelling of 50510110556001 in words is "fifty trillion, five hundred ten billion, one hundred ten million, five hundred fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •