Base | Representation |
---|---|
bin | 10110110001000111011001… |
… | …01101000111010011100001 |
3 | 20120021021101021212211220202 |
4 | 23120203230231013103201 |
5 | 23030240343133122203 |
6 | 254252015313114545 |
7 | 13355104610532161 |
oct | 1330435455072341 |
9 | 216237337784822 |
10 | 50066110051553 |
11 | 14a52a109a3332 |
12 | 5747192b58a55 |
13 | 21c22a1c9b88b |
14 | c512d97565a1 |
15 | 5bc5039d8388 |
hex | 2d88ecb474e1 |
50066110051553 has 32 divisors (see below), whose sum is σ = 52035241104000. Its totient is φ = 48146455019520.
The previous prime is 50066110051513. The next prime is 50066110051597. The reversal of 50066110051553 is 35515001166005.
50066110051553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 50066110051553 - 28 = 50066110051297 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (50066110051513) 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 31 ways as a sum of consecutive naturals, for example, 1659946793 + ... + 1659976953.
It is an arithmetic number, because the mean of its divisors is an integer number (1626101284500).
Almost surely, 250066110051553 is an apocalyptic number.
It is an amenable number.
50066110051553 is a deficient number, since it is larger than the sum of its proper divisors (1969131052447).
50066110051553 is a wasteful number, since it uses less digits than its factorization.
50066110051553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33665.
The product of its (nonzero) digits is 67500, while the sum is 38.
The spelling of 50066110051553 in words is "fifty trillion, sixty-six billion, one hundred ten million, fifty-one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •