Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …00111001001100110010001 |
3 | 20120012211101021210102212212 |
4 | 23120111220013021212101 |
5 | 23030013422123330243 |
6 | 254241040125201505 |
7 | 13354031311414616 |
oct | 1330255007114621 |
9 | 216184337712785 |
10 | 50051000605073 |
11 | 14a47568018586 |
12 | 5744276a00295 |
13 | 21c0a348823c0 |
14 | c506a4ba250d |
15 | 5bbe1c2a5318 |
hex | 2d85681c9991 |
50051000605073 has 4 divisors (see below), whose sum is σ = 53901077574708. Its totient is φ = 46200923635440.
The previous prime is 50051000605057. The next prime is 50051000605087. The reversal of 50051000605073 is 37050600015005.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 24106361891329 + 25944638713744 = 4909823^2 + 5093588^2 .
It is a cyclic number.
It is not a de Polignac number, because 50051000605073 - 24 = 50051000605057 is a prime.
It is a super-2 number, since 2×500510006050732 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (50051000605033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1925038484798 + ... + 1925038484823.
It is an arithmetic number, because the mean of its divisors is an integer number (13475269393677).
Almost surely, 250051000605073 is an apocalyptic number.
It is an amenable number.
50051000605073 is a deficient number, since it is larger than the sum of its proper divisors (3850076969635).
50051000605073 is a wasteful number, since it uses less digits than its factorization.
50051000605073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3850076969634.
The product of its (nonzero) digits is 15750, while the sum is 32.
The spelling of 50051000605073 in words is "fifty trillion, fifty-one billion, six hundred five thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •