Base | Representation |
---|---|
bin | 111100100001111… |
… | …1001010000111101 |
3 | 12020112210202012020 |
4 | 1321003321100331 |
5 | 13124423023000 |
6 | 533312430353 |
7 | 101221521516 |
oct | 17103712075 |
9 | 5215722166 |
10 | 2031064125 |
11 | 9525345a2 |
12 | 4882483b9 |
13 | 264a327bc |
14 | 153a63a0d |
15 | bd49bba0 |
hex | 790f943d |
2031064125 has 32 divisors (see below), whose sum is σ = 3471057408. Its totient is φ = 1053950400.
The previous prime is 2031064111. The next prime is 2031064141. The reversal of 2031064125 is 5214601302.
It is not a de Polignac number, because 2031064125 - 215 = 2031031357 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2031064095 and 2031064104.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 59317 + ... + 87066.
It is an arithmetic number, because the mean of its divisors is an integer number (108470544).
Almost surely, 22031064125 is an apocalyptic number.
2031064125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2031064125 is a deficient number, since it is larger than the sum of its proper divisors (1439993283).
2031064125 is a wasteful number, since it uses less digits than its factorization.
2031064125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146438 (or 146428 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 2031064125 is about 45067.3287981438. The cubic root of 2031064125 is about 1266.4106236473.
Adding to 2031064125 its reverse (5214601302), we get a palindrome (7245665427).
The spelling of 2031064125 in words is "two billion, thirty-one million, sixty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •