Base | Representation |
---|---|
bin | 111101000110100… |
… | …1011010110001101 |
3 | 12021212221202011001 |
4 | 1322031023112031 |
5 | 13144332242301 |
6 | 535240300301 |
7 | 101544022156 |
oct | 17215132615 |
9 | 5255852131 |
10 | 2050274701 |
11 | 962365802 |
12 | 492771691 |
13 | 2689ca7c7 |
14 | 15642492d |
15 | beee3c01 |
hex | 7a34b58d |
2050274701 has 4 divisors (see below), whose sum is σ = 2097955552. Its totient is φ = 2002593852.
The previous prime is 2050274687. The next prime is 2050274713. The reversal of 2050274701 is 1074720502.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2050274701 - 29 = 2050274189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2050274701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2050274731) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 23840361 + ... + 23840446.
It is an arithmetic number, because the mean of its divisors is an integer number (524488888).
Almost surely, 22050274701 is an apocalyptic number.
It is an amenable number.
2050274701 is a deficient number, since it is larger than the sum of its proper divisors (47680851).
2050274701 is an equidigital number, since it uses as much as digits as its factorization.
2050274701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47680850.
The product of its (nonzero) digits is 3920, while the sum is 28.
The square root of 2050274701 is about 45279.9591541335. The cubic root of 2050274701 is about 1270.3908320342.
The spelling of 2050274701 in words is "two billion, fifty million, two hundred seventy-four thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •