Base | Representation |
---|---|
bin | 1010001011000101… |
… | …1010100010011101 |
3 | 21001022121012102210 |
4 | 2202301122202131 |
5 | 21043100101444 |
6 | 1130551511033 |
7 | 124446643656 |
oct | 24261324235 |
9 | 7038535383 |
10 | 2730862749 |
11 | 118155666a |
12 | 642688479 |
13 | 346a01324 |
14 | 1bc98852d |
15 | 10eb2e7b9 |
hex | a2c5a89d |
2730862749 has 32 divisors (see below), whose sum is σ = 3937248000. Its totient is φ = 1678476800.
The previous prime is 2730862747. The next prime is 2730862777. The reversal of 2730862749 is 9472680372.
It is a cyclic number.
It is not a de Polignac number, because 2730862749 - 21 = 2730862747 is a prime.
It is a super-2 number, since 2×27308627492 = 14915222707751674002, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2730862698 and 2730862707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2730862741) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2098399 + ... + 2099699.
It is an arithmetic number, because the mean of its divisors is an integer number (123039000).
Almost surely, 22730862749 is an apocalyptic number.
2730862749 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
It is an amenable number.
2730862749 is a deficient number, since it is larger than the sum of its proper divisors (1206385251).
2730862749 is a wasteful number, since it uses less digits than its factorization.
2730862749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2405.
The product of its (nonzero) digits is 1016064, while the sum is 48.
The square root of 2730862749 is about 52257.6573240707. The cubic root of 2730862749 is about 1397.7621985773.
The spelling of 2730862749 in words is "two billion, seven hundred thirty million, eight hundred sixty-two thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •