Base | Representation |
---|---|
bin | 101110111010101110… |
… | …001111110010000101 |
3 | 11211000212211022011211 |
4 | 232322232033302011 |
5 | 1311133043410301 |
6 | 35050520531421 |
7 | 3432253126453 |
oct | 567256176205 |
9 | 154025738154 |
10 | 50377325701 |
11 | 1a40176147a |
12 | 991b320b71 |
13 | 499aca2881 |
14 | 261c8b19d3 |
15 | 149ca7a051 |
hex | bbab8fc85 |
50377325701 has 4 divisors (see below), whose sum is σ = 51606041004. Its totient is φ = 49148610400.
The previous prime is 50377325657. The next prime is 50377325731. The reversal of 50377325701 is 10752377305.
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 14303920801 + 36073404900 = 119599^2 + 189930^2 .
It is a cyclic number.
It is not a de Polignac number, because 50377325701 - 213 = 50377317509 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50377325731) 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, 614357590 + ... + 614357671.
It is an arithmetic number, because the mean of its divisors is an integer number (12901510251).
Almost surely, 250377325701 is an apocalyptic number.
It is an amenable number.
50377325701 is a deficient number, since it is larger than the sum of its proper divisors (1228715303).
50377325701 is a wasteful number, since it uses less digits than its factorization.
50377325701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1228715302.
The product of its (nonzero) digits is 154350, while the sum is 40.
The spelling of 50377325701 in words is "fifty billion, three hundred seventy-seven million, three hundred twenty-five thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •