Base | Representation |
---|---|
bin | 1000000100000111… |
… | …0111011011101001 |
3 | 12120212100200211001 |
4 | 2001001313123221 |
5 | 13413134000212 |
6 | 554450035001 |
7 | 104434033441 |
oct | 20101673351 |
9 | 5525320731 |
10 | 2164750057 |
11 | a10a43838 |
12 | 504b78a61 |
13 | 28663bbc2 |
14 | 167703121 |
15 | ca0a7657 |
hex | 810776e9 |
2164750057 has 4 divisors (see below), whose sum is σ = 2234580736. Its totient is φ = 2094919380.
The previous prime is 2164750051. The next prime is 2164750079. The reversal of 2164750057 is 7500574612.
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 2164750057 - 27 = 2164749929 is a prime.
It is a super-2 number, since 2×21647500572 = 9372285618563006498, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2164749998 and 2164750025.
It is not an unprimeable number, because it can be changed into a prime (2164750051) 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, 34915293 + ... + 34915354.
It is an arithmetic number, because the mean of its divisors is an integer number (558645184).
Almost surely, 22164750057 is an apocalyptic number.
It is an amenable number.
2164750057 is a deficient number, since it is larger than the sum of its proper divisors (69830679).
2164750057 is an equidigital number, since it uses as much as digits as its factorization.
2164750057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69830678.
The product of its (nonzero) digits is 58800, while the sum is 37.
The square root of 2164750057 is about 46526.8745672864. The cubic root of 2164750057 is about 1293.6076839354.
The spelling of 2164750057 in words is "two billion, one hundred sixty-four million, seven hundred fifty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •