Base | Representation |
---|---|
bin | 1010010100001001… |
… | …1100100100000001 |
3 | 21010222010202221021 |
4 | 2211002130210001 |
5 | 21132313210141 |
6 | 1134430425441 |
7 | 125421052021 |
oct | 24502344401 |
9 | 7128122837 |
10 | 2768881921 |
11 | 11a0a63a73 |
12 | 653362281 |
13 | 351853390 |
14 | 1c3a43a81 |
15 | 11313e6d1 |
hex | a509c901 |
2768881921 has 8 divisors (see below), whose sum is σ = 2982354984. Its totient is φ = 2555477760.
The previous prime is 2768881889. The next prime is 2768881949. The reversal of 2768881921 is 1291888672.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 8850625 + 2760031296 = 2975^2 + 52536^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2768881921 - 25 = 2768881889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2768881991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91875 + ... + 118231.
It is an arithmetic number, because the mean of its divisors is an integer number (372794373).
Almost surely, 22768881921 is an apocalyptic number.
It is an amenable number.
2768881921 is a deficient number, since it is larger than the sum of its proper divisors (213473063).
2768881921 is a wasteful number, since it uses less digits than its factorization.
2768881921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34451.
The product of its digits is 774144, while the sum is 52.
The square root of 2768881921 is about 52620.1664858636. The cubic root of 2768881921 is about 1404.2188928349.
The spelling of 2768881921 in words is "two billion, seven hundred sixty-eight million, eight hundred eighty-one thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •