Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …01000011101000000001010 |
3 | 20200202100002210121212100110 |
4 | 23212320010020131000022 |
5 | 23142401000423330231 |
6 | 300324023002015150 |
7 | 13516146562330422 |
oct | 1346700410350012 |
9 | 220670083555313 |
10 | 51050050605066 |
11 | 152a22287703a7 |
12 | 5885a127a74b6 |
13 | 2263ccb099156 |
14 | c86b9ad95482 |
15 | 5d7de0415046 |
hex | 2e6e0421d00a |
51050050605066 has 16 divisors (see below), whose sum is σ = 102114597972384. Its totient is φ = 17014267407984.
The previous prime is 51050050605013. The next prime is 51050050605077. The reversal of 51050050605066 is 66050605005015.
It is a super-2 number, since 2×510500506050662 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 603985981 + ... + 604070496.
It is an arithmetic number, because the mean of its divisors is an integer number (6382162373274).
Almost surely, 251050050605066 is an apocalyptic number.
51050050605066 is an abundant number, since it is smaller than the sum of its proper divisors (51064547367318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51050050605066 is a wasteful number, since it uses less digits than its factorization.
51050050605066 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1208063525.
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 51050050605066 in words is "fifty-one trillion, fifty billion, fifty million, six hundred five thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •