Base | Representation |
---|---|
bin | 1000011100000000… |
… | …1000111011101001 |
3 | 12211211220221001000 |
4 | 2013000020323221 |
5 | 14114312220440 |
6 | 1012425545213 |
7 | 110061564045 |
oct | 20700107351 |
9 | 5754827030 |
10 | 2264960745 |
11 | a62569593 |
12 | 532645209 |
13 | 2a1327578 |
14 | 176b4b025 |
15 | d3c9e730 |
hex | 87008ee9 |
2264960745 has 64 divisors (see below), whose sum is σ = 4367623680. Its totient is φ = 1109145600.
The previous prime is 2264960743. The next prime is 2264960749. The reversal of 2264960745 is 5470694622.
It is not a de Polignac number, because 2264960745 - 21 = 2264960743 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2264960745.
It is not an unprimeable number, because it can be changed into a prime (2264960743) 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 63 ways as a sum of consecutive naturals, for example, 82060 + ... + 106130.
It is an arithmetic number, because the mean of its divisors is an integer number (68244120).
Almost surely, 22264960745 is an apocalyptic number.
It is an amenable number.
2264960745 is a deficient number, since it is larger than the sum of its proper divisors (2102662935).
2264960745 is a wasteful number, since it uses less digits than its factorization.
2264960745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24143 (or 24137 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 45.
The square root of 2264960745 is about 47591.6037237662. The cubic root of 2264960745 is about 1313.2685979856.
The spelling of 2264960745 in words is "two billion, two hundred sixty-four million, nine hundred sixty thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •