Base | Representation |
---|---|
bin | 111101000110111… |
… | …1111100101000001 |
3 | 12021220100121121202 |
4 | 1322031333211001 |
5 | 13144411114031 |
6 | 535245030545 |
7 | 101545602665 |
oct | 17215774501 |
9 | 5256317552 |
10 | 2050488641 |
11 | 9624a1513 |
12 | 492855455 |
13 | 268a73cb6 |
14 | 15647c8a5 |
15 | c00372cb |
hex | 7a37f941 |
2050488641 has 4 divisors (see below), whose sum is σ = 2050581552. Its totient is φ = 2050395732.
The previous prime is 2050488619. The next prime is 2050488647. The reversal of 2050488641 is 1468840502.
It is a happy number.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2050488641 - 26 = 2050488577 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2050488595 and 2050488604.
It is not an unprimeable number, because it can be changed into a prime (2050488647) 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, 7670 + ... + 64496.
It is an arithmetic number, because the mean of its divisors is an integer number (512645388).
Almost surely, 22050488641 is an apocalyptic number.
It is an amenable number.
2050488641 is a deficient number, since it is larger than the sum of its proper divisors (92911).
2050488641 is an equidigital number, since it uses as much as digits as its factorization.
2050488641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92910.
The product of its (nonzero) digits is 61440, while the sum is 38.
The square root of 2050488641 is about 45282.3215063009. The cubic root of 2050488641 is about 1270.4350176518.
The spelling of 2050488641 in words is "two billion, fifty million, four hundred eighty-eight thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •