Base | Representation |
---|---|
bin | 1010001011000000… |
… | …0101101111110001 |
3 | 21001021221120000112 |
4 | 2202300011233301 |
5 | 21043002443231 |
6 | 1130540231105 |
7 | 124443666263 |
oct | 24260055761 |
9 | 7037846015 |
10 | 2730515441 |
11 | 1181339735 |
12 | 64253b495 |
13 | 34690c214 |
14 | 1bc8d7b33 |
15 | 10eab192b |
hex | a2c05bf1 |
2730515441 has 4 divisors (see below), whose sum is σ = 2874226800. Its totient is φ = 2586804084.
The previous prime is 2730515429. The next prime is 2730515519. The reversal of 2730515441 is 1445150372.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2730515441 - 26 = 2730515377 is a prime.
It is a super-3 number, since 3×27305154413 (a number of 29 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2730515398 and 2730515407.
It is not an unprimeable number, because it can be changed into a prime (2730512441) 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, 71855651 + ... + 71855688.
It is an arithmetic number, because the mean of its divisors is an integer number (718556700).
Almost surely, 22730515441 is an apocalyptic number.
It is an amenable number.
2730515441 is a deficient number, since it is larger than the sum of its proper divisors (143711359).
2730515441 is a wasteful number, since it uses less digits than its factorization.
2730515441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143711358.
The product of its (nonzero) digits is 16800, while the sum is 32.
The square root of 2730515441 is about 52254.3341838742. The cubic root of 2730515441 is about 1397.7029407994.
The spelling of 2730515441 in words is "two billion, seven hundred thirty million, five hundred fifteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •