Base | Representation |
---|---|
bin | 1010000010001110… |
… | …0011010001100000 |
3 | 20221201121211011200 |
4 | 2200203203101200 |
5 | 21004040032310 |
6 | 1123142441200 |
7 | 123515565126 |
oct | 24043432140 |
9 | 6851554150 |
10 | 2693674080 |
11 | 1162566229 |
12 | 632133200 |
13 | 33c0b02b6 |
14 | 1b7a67916 |
15 | 10b7359c0 |
hex | a08e3460 |
2693674080 has 144 divisors (see below), whose sum is σ = 9676059120. Its totient is φ = 680500224.
The previous prime is 2693674073. The next prime is 2693674121. The reversal of 2693674080 is 804763962.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 21867 + ... + 76586.
It is an arithmetic number, because the mean of its divisors is an integer number (67194855).
Almost surely, 22693674080 is an apocalyptic number.
2693674080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2693674080 is an abundant number, since it is smaller than the sum of its proper divisors (6982385040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2693674080 is a wasteful number, since it uses less digits than its factorization.
2693674080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98493 (or 98482 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 45.
The square root of 2693674080 is about 51900.6173373689. The cubic root of 2693674080 is about 1391.3883063487.
The spelling of 2693674080 in words is "two billion, six hundred ninety-three million, six hundred seventy-four thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •