Base | Representation |
---|---|
bin | 111111011011110… |
… | …0110011111011001 |
3 | 12111100011020122212 |
4 | 1332313212133121 |
5 | 13324344123133 |
6 | 551113124505 |
7 | 103513664222 |
oct | 17667463731 |
9 | 5440136585 |
10 | 2128504793 |
11 | 9a2538178 |
12 | 4b49b9735 |
13 | 27bc8b3bc |
14 | 16298a249 |
15 | c6ce8148 |
hex | 7ede67d9 |
2128504793 has 4 divisors (see below), whose sum is σ = 2201901540. Its totient is φ = 2055108048.
The previous prime is 2128504789. The next prime is 2128504823. The reversal of 2128504793 is 3974058212.
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 887563264 + 1240941529 = 29792^2 + 35227^2 .
It is a cyclic number.
It is not a de Polignac number, because 2128504793 - 22 = 2128504789 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2128504793.
It is not an unprimeable number, because it can be changed into a prime (2128504723) 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, 36698330 + ... + 36698387.
It is an arithmetic number, because the mean of its divisors is an integer number (550475385).
Almost surely, 22128504793 is an apocalyptic number.
It is an amenable number.
2128504793 is a deficient number, since it is larger than the sum of its proper divisors (73396747).
2128504793 is an equidigital number, since it uses as much as digits as its factorization.
2128504793 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73396746.
The product of its (nonzero) digits is 120960, while the sum is 41.
The square root of 2128504793 is about 46135.7214422837. The cubic root of 2128504793 is about 1286.3472157071.
The spelling of 2128504793 in words is "two billion, one hundred twenty-eight million, five hundred four thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •