Base | Representation |
---|---|
bin | 111100100001111… |
… | …0011101110010001 |
3 | 12020112202121001111 |
4 | 1321003303232101 |
5 | 13124421311200 |
6 | 533312133321 |
7 | 101221365400 |
oct | 17103635621 |
9 | 5215677044 |
10 | 2031041425 |
11 | 952519536 |
12 | 488237241 |
13 | 264a2537a |
14 | 153a59637 |
15 | bd4950ba |
hex | 790f3b91 |
2031041425 has 54 divisors (see below), whose sum is σ = 3112687122. Its totient is φ = 1310561280.
The previous prime is 2031041399. The next prime is 2031041443. The reversal of 2031041425 is 5241401302.
It can be written as a sum of positive squares in 9 ways, for example, as 619611664 + 1411429761 = 24892^2 + 37569^2 .
It is not a de Polignac number, because 2031041425 - 223 = 2022652817 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2031041396 and 2031041405.
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 53 ways as a sum of consecutive naturals, for example, 351157 + ... + 356893.
Almost surely, 22031041425 is an apocalyptic number.
2031041425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2031041425 is a deficient number, since it is larger than the sum of its proper divisors (1081645697).
2031041425 is a wasteful number, since it uses less digits than its factorization.
2031041425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5795 (or 5766 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 22.
The square root of 2031041425 is about 45067.0769520279. The cubic root of 2031041425 is about 1266.4059056560.
Adding to 2031041425 its reverse (5241401302), we get a palindrome (7272442727).
The spelling of 2031041425 in words is "two billion, thirty-one million, forty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •