Base | Representation |
---|---|
bin | 1010010011001101… |
… | …1101100111001001 |
3 | 21010200202012220211 |
4 | 2210303131213021 |
5 | 21130312012212 |
6 | 1134210321121 |
7 | 125342502355 |
oct | 24463354711 |
9 | 7120665824 |
10 | 2764954057 |
11 | 11998209a8 |
12 | 651b891a1 |
13 | 350aa95b8 |
14 | 1c3300465 |
15 | 112b159a7 |
hex | a4cdd9c9 |
2764954057 has 8 divisors (see below), whose sum is σ = 2835158816. Its totient is φ = 2695600512.
The previous prime is 2764954021. The next prime is 2764954063. The reversal of 2764954057 is 7504594672.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2764954057 - 211 = 2764952009 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2764954057.
It is not an unprimeable number, because it can be changed into a prime (2764954007) 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 7 ways as a sum of consecutive naturals, for example, 206223 + ... + 219220.
It is an arithmetic number, because the mean of its divisors is an integer number (354394852).
Almost surely, 22764954057 is an apocalyptic number.
It is an amenable number.
2764954057 is a deficient number, since it is larger than the sum of its proper divisors (70204759).
2764954057 is an equidigital number, since it uses as much as digits as its factorization.
2764954057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425607.
The product of its (nonzero) digits is 2116800, while the sum is 49.
The square root of 2764954057 is about 52582.8304392223. The cubic root of 2764954057 is about 1403.5545824576.
The spelling of 2764954057 in words is "two billion, seven hundred sixty-four million, nine hundred fifty-four thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •