Base | Representation |
---|---|
bin | 1010001101111101… |
… | …1010000010000000 |
3 | 21002011021201220120 |
4 | 2203133122002000 |
5 | 21104141404141 |
6 | 1132102140240 |
7 | 124654300155 |
oct | 24337320200 |
9 | 7064251816 |
10 | 2742919296 |
11 | 1188340957 |
12 | 646721680 |
13 | 349362c90 |
14 | 1c040622c |
15 | 110c11c66 |
hex | a37da080 |
2742919296 has 128 divisors (see below), whose sum is σ = 8117323200. Its totient is φ = 814829568.
The previous prime is 2742919279. The next prime is 2742919307. The reversal of 2742919296 is 6929192472.
It is a tau number, because it is divible by the number of its divisors (128).
It is an unprimeable number.
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, 135295 + ... + 154241.
Almost surely, 22742919296 is an apocalyptic number.
2742919296 is a gapful number since it is divisible by the number (26) 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 2742919296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4058661600).
2742919296 is an abundant number, since it is smaller than the sum of its proper divisors (5374403904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2742919296 is a wasteful number, since it uses less digits than its factorization.
2742919296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19006 (or 18994 counting only the distinct ones).
The product of its digits is 979776, while the sum is 51.
The square root of 2742919296 is about 52372.8870313639. The cubic root of 2742919296 is about 1399.8161826689.
The spelling of 2742919296 in words is "two billion, seven hundred forty-two million, nine hundred nineteen thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •