Base | Representation |
---|---|
bin | 1010001010111000… |
… | …0111111010000101 |
3 | 21001020222100222022 |
4 | 2202232013322011 |
5 | 21042340000010 |
6 | 1130521212525 |
7 | 124436421455 |
oct | 24256077205 |
9 | 7036870868 |
10 | 2730000005 |
11 | 1181017457 |
12 | 642331145 |
13 | 34678b725 |
14 | 1bc801d65 |
15 | 10ea0dd55 |
hex | a2b87e85 |
2730000005 has 4 divisors (see below), whose sum is σ = 3276000012. Its totient is φ = 2184000000.
The previous prime is 2729999989. The next prime is 2730000011. The reversal of 2730000005 is 5000000372.
2730000005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 365803876 + 2364196129 = 19126^2 + 48623^2 .
It is not a de Polignac number, because 2730000005 - 24 = 2729999989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 272999996 + ... + 273000005.
It is an arithmetic number, because the mean of its divisors is an integer number (819000003).
Almost surely, 22730000005 is an apocalyptic number.
It is an amenable number.
2730000005 is a deficient number, since it is larger than the sum of its proper divisors (546000007).
2730000005 is an equidigital number, since it uses as much as digits as its factorization.
2730000005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 546000006.
The product of its (nonzero) digits is 210, while the sum is 17.
The square root of 2730000005 is about 52249.4019583000. The cubic root of 2730000005 is about 1397.6149877169.
Adding to 2730000005 its reverse (5000000372), we get a palindrome (7730000377).
The spelling of 2730000005 in words is "two billion, seven hundred thirty million, five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •