Base | Representation |
---|---|
bin | 10110110000111101001000… |
… | …10011110101111100100101 |
3 | 20120020202011022200122001000 |
4 | 23120132210103311330211 |
5 | 23030143102212000010 |
6 | 254245304500223513 |
7 | 13354521230236524 |
oct | 1330364423657445 |
9 | 216222138618030 |
10 | 50060600500005 |
11 | 14a506439a5747 |
12 | 57460b599ab99 |
13 | 21c19046c24c4 |
14 | c50d35b344bb |
15 | 5bc2cee7d7c0 |
hex | 2d87a44f5f25 |
50060600500005 has 32 divisors (see below), whose sum is σ = 90215754952320. Its totient is φ = 26333247381120.
The previous prime is 50060600500003. The next prime is 50060600500033. The reversal of 50060600500005 is 50000500606005.
50060600500005 is a `hidden beast` number, since 5 + 0 + 0 + 6 + 0 + 600 + 50 + 0 + 0 + 0 + 5 = 666.
It is not a de Polignac number, because 50060600500005 - 21 = 50060600500003 is a prime.
It is a super-2 number, since 2×500606005000052 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50060600500003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2539848111 + ... + 2539867820.
It is an arithmetic number, because the mean of its divisors is an integer number (2819242342260).
Almost surely, 250060600500005 is an apocalyptic number.
It is an amenable number.
50060600500005 is a deficient number, since it is larger than the sum of its proper divisors (40155154452315).
50060600500005 is a wasteful number, since it uses less digits than its factorization.
50060600500005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5079716018 (or 5079716012 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The spelling of 50060600500005 in words is "fifty trillion, sixty billion, six hundred million, five hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •