Base | Representation |
---|---|
bin | 1010001010111111… |
… | …1101000001000001 |
3 | 21001021212201222002 |
4 | 2202233331001001 |
5 | 21043000322211 |
6 | 1130535353345 |
7 | 124443460106 |
oct | 24257750101 |
9 | 7037781862 |
10 | 2730479681 |
11 | 1181314886 |
12 | 642522855 |
13 | 3468c8b67 |
14 | 1bc8c8aad |
15 | 10eaa603b |
hex | a2bfd041 |
2730479681 has 4 divisors (see below), whose sum is σ = 2754643332. Its totient is φ = 2706316032.
The previous prime is 2730479669. The next prime is 2730479737. The reversal of 2730479681 is 1869740372.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1302849025 + 1427630656 = 36095^2 + 37784^2 .
It is a cyclic number.
It is not a de Polignac number, because 2730479681 - 222 = 2726285377 is a prime.
It is a super-2 number, since 2×27304796812 = 14911038576707723522, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2730479581) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12081656 + ... + 12081881.
It is an arithmetic number, because the mean of its divisors is an integer number (688660833).
Almost surely, 22730479681 is an apocalyptic number.
It is an amenable number.
2730479681 is a deficient number, since it is larger than the sum of its proper divisors (24163651).
2730479681 is a wasteful number, since it uses less digits than its factorization.
2730479681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24163650.
The product of its (nonzero) digits is 508032, while the sum is 47.
The square root of 2730479681 is about 52253.9920101804. The cubic root of 2730479681 is about 1397.6968391339.
The spelling of 2730479681 in words is "two billion, seven hundred thirty million, four hundred seventy-nine thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •