Base | Representation |
---|---|
bin | 1010010100010100… |
… | …0000101011011001 |
3 | 21011000101221001011 |
4 | 2211011000223121 |
5 | 21133001213022 |
6 | 1134453053521 |
7 | 125426551600 |
oct | 24505005331 |
9 | 7130357034 |
10 | 2769554137 |
11 | 11a1383019 |
12 | 6536272a1 |
13 | 351a2a33c |
14 | 1c3b7aa37 |
15 | 113223977 |
hex | a5140ad9 |
2769554137 has 12 divisors (see below), whose sum is σ = 3223355700. Its totient is φ = 2372702976.
The previous prime is 2769554093. The next prime is 2769554149. The reversal of 2769554137 is 7314559672.
It can be written as a sum of positive squares in 2 ways, for example, as 195412441 + 2574141696 = 13979^2 + 50736^2 .
It is a de Polignac number, because none of the positive numbers 2k-2769554137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2769554197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 91489 + ... + 117937.
It is an arithmetic number, because the mean of its divisors is an integer number (268612975).
Almost surely, 22769554137 is an apocalyptic number.
It is an amenable number.
2769554137 is a deficient number, since it is larger than the sum of its proper divisors (453801563).
2769554137 is a wasteful number, since it uses less digits than its factorization.
2769554137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28600 (or 28593 counting only the distinct ones).
The product of its digits is 1587600, while the sum is 49.
The square root of 2769554137 is about 52626.5535352639. The cubic root of 2769554137 is about 1404.3325201709.
The spelling of 2769554137 in words is "two billion, seven hundred sixty-nine million, five hundred fifty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •