Base | Representation |
---|---|
bin | 1010000011001000… |
… | …0010001110101101 |
3 | 20221222202201102101 |
4 | 2200302002032231 |
5 | 21011023032033 |
6 | 1123400055101 |
7 | 123563060425 |
oct | 24062021655 |
9 | 6858681371 |
10 | 2697470893 |
11 | 1164719897 |
12 | 633464491 |
13 | 33cb0c530 |
14 | 1b8375485 |
15 | 10bc3597d |
hex | a0c823ad |
2697470893 has 8 divisors (see below), whose sum is σ = 2975822136. Its totient is φ = 2429241600.
The previous prime is 2697470891. The next prime is 2697470917. The reversal of 2697470893 is 3980747962.
It can be written as a sum of positive squares in 4 ways, for example, as 131744484 + 2565726409 = 11478^2 + 50653^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2697470893 - 21 = 2697470891 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2697470891) 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 7 ways as a sum of consecutive naturals, for example, 2529928 + ... + 2530993.
It is an arithmetic number, because the mean of its divisors is an integer number (371977767).
Almost surely, 22697470893 is an apocalyptic number.
It is an amenable number.
2697470893 is a deficient number, since it is larger than the sum of its proper divisors (278351243).
2697470893 is a wasteful number, since it uses less digits than its factorization.
2697470893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5060975.
The product of its (nonzero) digits is 4572288, while the sum is 55.
The square root of 2697470893 is about 51937.1821819398. The cubic root of 2697470893 is about 1392.0417337107.
The spelling of 2697470893 in words is "two billion, six hundred ninety-seven million, four hundred seventy thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •