Base | Representation |
---|---|
bin | 1010001110100000… |
… | …0111111110100000 |
3 | 21002022120211210221 |
4 | 2203220013332200 |
5 | 21110233022030 |
6 | 1132223132424 |
7 | 125012566033 |
oct | 24350077640 |
9 | 7068524727 |
10 | 2745204640 |
11 | 1189661972 |
12 | 647444114 |
13 | 349983259 |
14 | 1c083d01a |
15 | 111013e7a |
hex | a3a07fa0 |
2745204640 has 48 divisors (see below), whose sum is σ = 6660845352. Its totient is φ = 1068401664.
The previous prime is 2745204611. The next prime is 2745204647. The reversal of 2745204640 is 464025472.
It can be written as a sum of positive squares in 4 ways, for example, as 2234263824 + 510940816 = 47268^2 + 22604^2 .
It is a super-2 number, since 2×27452046402 = 15072297030955059200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2745204596 and 2745204605.
It is not an unprimeable number, because it can be changed into a prime (2745204647) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 225939 + ... + 237778.
Almost surely, 22745204640 is an apocalyptic number.
2745204640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2745204640 is an abundant number, since it is smaller than the sum of its proper divisors (3915640712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2745204640 is a wasteful number, since it uses less digits than its factorization.
2745204640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 463769 (or 463761 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 34.
The square root of 2745204640 is about 52394.7004953745. The cubic root of 2745204640 is about 1400.2048407756.
The spelling of 2745204640 in words is "two billion, seven hundred forty-five million, two hundred four thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •