Base | Representation |
---|---|
bin | 101110101010110010… |
… | …101100011001000001 |
3 | 11210100020220121002001 |
4 | 232222302230121001 |
5 | 1310111133243001 |
6 | 35004212224001 |
7 | 3422526306505 |
oct | 565262543101 |
9 | 153306817061 |
10 | 50110056001 |
11 | 1a284902825 |
12 | 986590b001 |
13 | 49577c4715 |
14 | 25d51bc305 |
15 | 1484384001 |
hex | baacac641 |
50110056001 has 16 divisors (see below), whose sum is σ = 55377661824. Its totient is φ = 45101193984.
The previous prime is 50110055971. The next prime is 50110056037. The reversal of 50110056001 is 10065001105.
It is a cyclic number.
It is not a de Polignac number, because 50110056001 - 27 = 50110055873 is a prime.
It is a super-2 number, since 2×501100560012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50110056001.
It is not an unprimeable number, because it can be changed into a prime (50110056041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1972486 + ... + 1997728.
It is an arithmetic number, because the mean of its divisors is an integer number (3461103864).
Almost surely, 250110056001 is an apocalyptic number.
It is an amenable number.
50110056001 is a deficient number, since it is larger than the sum of its proper divisors (5267605823).
50110056001 is a wasteful number, since it uses less digits than its factorization.
50110056001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30360.
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 50110056001 its reverse (10065001105), we get a palindrome (60175057106).
The spelling of 50110056001 in words is "fifty billion, one hundred ten million, fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •