Base | Representation |
---|---|
bin | 1010010010010010… |
… | …1111001000100100 |
3 | 21010102111002110110 |
4 | 2210210233020210 |
5 | 21123314444133 |
6 | 1133551453020 |
7 | 125264623524 |
oct | 24444571044 |
9 | 7112432413 |
10 | 2761093668 |
11 | 11976245a3 |
12 | 650827170 |
13 | 350057448 |
14 | 1c29b7684 |
15 | 112601c63 |
hex | a492f224 |
2761093668 has 48 divisors (see below), whose sum is σ = 6605573184. Its totient is φ = 897116160.
The previous prime is 2761093663. The next prime is 2761093679. The reversal of 2761093668 is 8663901672.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (2761093663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 833271 + ... + 836577.
It is an arithmetic number, because the mean of its divisors is an integer number (137616108).
Almost surely, 22761093668 is an apocalyptic number.
It is an amenable number.
2761093668 is an abundant number, since it is smaller than the sum of its proper divisors (3844479516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2761093668 is a wasteful number, since it uses less digits than its factorization.
2761093668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5052 (or 5050 counting only the distinct ones).
The product of its (nonzero) digits is 653184, while the sum is 48.
The square root of 2761093668 is about 52546.1099226194. The cubic root of 2761093668 is about 1402.9010706629.
It can be divided in two parts, 27610 and 93668, that added together give a triangular number (121278 = T492).
The spelling of 2761093668 in words is "two billion, seven hundred sixty-one million, ninety-three thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •