Base | Representation |
---|---|
bin | 111101110000100… |
… | …0010111010101001 |
3 | 12100102022201200012 |
4 | 1323201002322221 |
5 | 13220444312030 |
6 | 541343421305 |
7 | 102231631055 |
oct | 17341027251 |
9 | 5312281605 |
10 | 2072260265 |
11 | 973811899 |
12 | 499bb4835 |
13 | 27042790a |
14 | 159308c65 |
15 | c1dd8095 |
hex | 7b842ea9 |
2072260265 has 8 divisors (see below), whose sum is σ = 2487143880. Its totient is φ = 1657520512.
The previous prime is 2072260261. The next prime is 2072260277. The reversal of 2072260265 is 5620622702.
It can be written as a sum of positive squares in 4 ways, for example, as 616379929 + 1455880336 = 24827^2 + 38156^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 2072260265 - 22 = 2072260261 is a prime.
It is a super-3 number, since 3×20722602653 (a number of 29 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (2072260261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1220 + ... + 64389.
It is an arithmetic number, because the mean of its divisors is an integer number (310892985).
Almost surely, 22072260265 is an apocalyptic number.
It is an amenable number.
2072260265 is a deficient number, since it is larger than the sum of its proper divisors (414883615).
2072260265 is an equidigital number, since it uses as much as digits as its factorization.
2072260265 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71931.
The product of its (nonzero) digits is 20160, while the sum is 32.
The square root of 2072260265 is about 45522.0854640909. The cubic root of 2072260265 is about 1274.9155940536.
Adding to 2072260265 its reverse (5620622702), we get a palindrome (7692882967).
The spelling of 2072260265 in words is "two billion, seventy-two million, two hundred sixty thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •