Base | Representation |
---|---|
bin | 10110111111010110111110… |
… | …01111101101010000001001 |
3 | 20122000001121110012002110110 |
4 | 23133223133033231100021 |
5 | 23111300141142314401 |
6 | 255304514135304533 |
7 | 13435341452022015 |
oct | 1337533717552011 |
9 | 218001543162413 |
10 | 50555510510601 |
11 | 15121520781828 |
12 | 5805bb621b149 |
13 | 2229497164515 |
14 | c6ac84d4d545 |
15 | 5ca0e8cd19d6 |
hex | 2dfadf3ed409 |
50555510510601 has 4 divisors (see below), whose sum is σ = 67407347347472. Its totient is φ = 33703673673732.
The previous prime is 50555510510563. The next prime is 50555510510657. The reversal of 50555510510601 is 10601501555505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 50555510510601 - 26 = 50555510510537 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 50555510510601.
It is not an unprimeable number, because it can be changed into a prime (50555510514601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8425918418431 + ... + 8425918418436.
It is an arithmetic number, because the mean of its divisors is an integer number (16851836836868).
Almost surely, 250555510510601 is an apocalyptic number.
It is an amenable number.
50555510510601 is a deficient number, since it is larger than the sum of its proper divisors (16851836836871).
50555510510601 is a wasteful number, since it uses less digits than its factorization.
50555510510601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16851836836870.
The product of its (nonzero) digits is 93750, while the sum is 39.
The spelling of 50555510510601 in words is "fifty trillion, five hundred fifty-five billion, five hundred ten million, five hundred ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •