Base | Representation |
---|---|
bin | 101110100100110111… |
… | …001000011001100001 |
3 | 11210002022200110201212 |
4 | 232210313020121201 |
5 | 1304410200243001 |
6 | 34550255435505 |
7 | 3420210466160 |
oct | 564467103141 |
9 | 153068613655 |
10 | 50010556001 |
11 | 1a233722a1a |
12 | 9838525b95 |
13 | 493ccc7693 |
14 | 25c5cbb3d7 |
15 | 147a77c7bb |
hex | ba4dc8661 |
50010556001 has 16 divisors (see below), whose sum is σ = 58729150464. Its totient is φ = 41696712144.
The previous prime is 50010555967. The next prime is 50010556007. The reversal of 50010556001 is 10065501005.
It is a cyclic number.
It is not a de Polignac number, because 50010556001 - 214 = 50010539617 is a prime.
It is a super-2 number, since 2×500105560012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (50010556007) 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, 412655 + ... + 519908.
It is an arithmetic number, because the mean of its divisors is an integer number (3670571904).
Almost surely, 250010556001 is an apocalyptic number.
It is an amenable number.
50010556001 is a deficient number, since it is larger than the sum of its proper divisors (8718594463).
50010556001 is a wasteful number, since it uses less digits than its factorization.
50010556001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 932780.
The product of its (nonzero) digits is 750, while the sum is 23.
The spelling of 50010556001 in words is "fifty billion, ten million, five hundred fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •