Base | Representation |
---|---|
bin | 1010000010010110… |
… | …0101010100011001 |
3 | 20221202121212212000 |
4 | 2200211211110121 |
5 | 21004204103440 |
6 | 1123202111213 |
7 | 123523244106 |
oct | 24045452431 |
9 | 6852555760 |
10 | 2694206745 |
11 | 116289a44a |
12 | 63234b509 |
13 | 33c238899 |
14 | 1b7b65aad |
15 | 10b7dd730 |
hex | a0965519 |
2694206745 has 96 divisors (see below), whose sum is σ = 5214441600. Its totient is φ = 1316165760.
The previous prime is 2694206731. The next prime is 2694206777. The reversal of 2694206745 is 5476024962.
It is not a de Polignac number, because 2694206745 - 29 = 2694206233 is a prime.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 2694206745.
It is an unprimeable number.
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 95 ways as a sum of consecutive naturals, for example, 2464419 + ... + 2465511.
It is an arithmetic number, because the mean of its divisors is an integer number (54317100).
Almost surely, 22694206745 is an apocalyptic number.
It is an amenable number.
2694206745 is a deficient number, since it is larger than the sum of its proper divisors (2520234855).
2694206745 is a wasteful number, since it uses less digits than its factorization.
2694206745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1188 (or 1151 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 45.
The square root of 2694206745 is about 51905.7486700654. The cubic root of 2694206745 is about 1391.4800144251.
The spelling of 2694206745 in words is "two billion, six hundred ninety-four million, two hundred six thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •