Base | Representation |
---|---|
bin | 111100110011011… |
… | …0111110001000001 |
3 | 12021012001120120010 |
4 | 1321212313301001 |
5 | 13134244424100 |
6 | 534241135133 |
7 | 101362460145 |
oct | 17146676101 |
9 | 5235046503 |
10 | 2040233025 |
11 | 9577272a6 |
12 | 48b32a4a9 |
13 | 2668c2c9c |
14 | 154d6d225 |
15 | be1ad750 |
hex | 799b7c41 |
2040233025 has 24 divisors (see below), whose sum is σ = 3374666944. Its totient is φ = 1087646400.
The previous prime is 2040233003. The next prime is 2040233047. The reversal of 2040233025 is 5203320402.
It is an interprime number because it is at equal distance from previous prime (2040233003) and next prime (2040233047).
It is not a de Polignac number, because 2040233025 - 25 = 2040232993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2040232992 and 2040233010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 225132 + ... + 234018.
Almost surely, 22040233025 is an apocalyptic number.
2040233025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2040233025 is a deficient number, since it is larger than the sum of its proper divisors (1334433919).
2040233025 is a wasteful number, since it uses less digits than its factorization.
2040233025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11961 (or 11956 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 21.
The square root of 2040233025 is about 45168.9387189914. The cubic root of 2040233025 is about 1268.3134296771.
Adding to 2040233025 its reverse (5203320402), we get a palindrome (7243553427).
The spelling of 2040233025 in words is "two billion, forty million, two hundred thirty-three thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •