Base | Representation |
---|---|
bin | 10110110000110001000011… |
… | …10010001101000110111111 |
3 | 20120020010102101100110200122 |
4 | 23120120201302031012333 |
5 | 23030041312103122412 |
6 | 254242313204045155 |
7 | 13354201435164050 |
oct | 1330304162150677 |
9 | 216203371313618 |
10 | 50054115676607 |
11 | 14a48916433969 |
12 | 57449a60937bb |
13 | 21c11100564b3 |
14 | c508bc7a0727 |
15 | 5bc0509c9572 |
hex | 2d8621c8d1bf |
50054115676607 has 24 divisors (see below), whose sum is σ = 58187100542688. Its totient is φ = 42178973253120.
The previous prime is 50054115676597. The next prime is 50054115676681. The reversal of 50054115676607 is 70667651145005.
50054115676607 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 50054115676607 - 210 = 50054115675583 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50054115676687) 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, 51429563 + ... + 52393779.
It is an arithmetic number, because the mean of its divisors is an integer number (2424462522612).
Almost surely, 250054115676607 is an apocalyptic number.
50054115676607 is a deficient number, since it is larger than the sum of its proper divisors (8132984866081).
50054115676607 is an equidigital number, since it uses as much as digits as its factorization.
50054115676607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 966339 (or 966278 counting only the distinct ones).
The product of its (nonzero) digits is 5292000, while the sum is 53.
The spelling of 50054115676607 in words is "fifty trillion, fifty-four billion, one hundred fifteen million, six hundred seventy-six thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •