Base | Representation |
---|---|
bin | 1010010100011001… |
… | …0000000000000000 |
3 | 21011001000102201121 |
4 | 2211012100000000 |
5 | 21133042112130 |
6 | 1134504042024 |
7 | 125432404045 |
oct | 24506200000 |
9 | 7131012647 |
10 | 2769879040 |
11 | 11a1585135 |
12 | 653763314 |
13 | 351b121a6 |
14 | 1c3c231cc |
15 | 113289d7a |
hex | a5190000 |
2769879040 has 136 divisors (see below), whose sum is σ = 6794720640. Its totient is φ = 1083703296.
The previous prime is 2769879011. The next prime is 2769879041. The reversal of 2769879040 is 409789672.
It is not an unprimeable number, because it can be changed into a prime (2769879041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25886667 + ... + 25886773.
Almost surely, 22769879040 is an apocalyptic number.
2769879040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2769879040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3397360320).
2769879040 is an abundant number, since it is smaller than the sum of its proper divisors (4024841600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2769879040 is an frugal number, since it uses more digits than its factorization.
2769879040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223 (or 193 counting only the distinct ones).
The product of its (nonzero) digits is 1524096, while the sum is 52.
The square root of 2769879040 is about 52629.6403179805. The cubic root of 2769879040 is about 1404.3874332226.
The spelling of 2769879040 in words is "two billion, seven hundred sixty-nine million, eight hundred seventy-nine thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •