Base | Representation |
---|---|
bin | 101110100111110011… |
… | …111111110011010000 |
3 | 11210012202211211200112 |
4 | 232213303333303100 |
5 | 1310010334103000 |
6 | 34555224540452 |
7 | 3421351353200 |
oct | 564763776320 |
9 | 153182754615 |
10 | 50060066000 |
11 | 1a25966957a |
12 | 9851021728 |
13 | 494a340a39 |
14 | 25cc6c8400 |
15 | 147ecac235 |
hex | ba7cffcd0 |
50060066000 has 120 divisors (see below), whose sum is σ = 140808003336. Its totient is φ = 17163417600.
The previous prime is 50060065997. The next prime is 50060066003. The reversal of 50060066000 is 66006005.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (50060065997) and next prime (50060066003).
It can be written as a sum of positive squares in 4 ways, for example, as 10738762384 + 39321303616 = 103628^2 + 198296^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50060066003) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 157409 + ... + 353408.
Almost surely, 250060066000 is an apocalyptic number.
50060066000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50060066000 is an abundant number, since it is smaller than the sum of its proper divisors (90747937336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50060066000 is a wasteful number, since it uses less digits than its factorization.
50060066000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510854 (or 510831 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 23.
The spelling of 50060066000 in words is "fifty billion, sixty million, sixty-six thousand", and thus it is an eban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •