Base | Representation |
---|---|
bin | 111110000111000… |
… | …100011100110001 |
3 | 2200121210011000020 |
4 | 332013010130301 |
5 | 4113230300000 |
6 | 251222314053 |
7 | 34552125213 |
oct | 7607043461 |
9 | 2617704006 |
10 | 1042040625 |
11 | 4952285aa |
12 | 250b88929 |
13 | 137b697b2 |
14 | 9c5725b3 |
15 | 61737ba0 |
hex | 3e1c4731 |
1042040625 has 48 divisors (see below), whose sum is σ = 1779636096. Its totient is φ = 542000000.
The previous prime is 1042040611. The next prime is 1042040641. The reversal of 1042040625 is 5260402401.
1042040625 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1042040625 - 26 = 1042040561 is a prime.
It is a hoax number, since the sum of its digits (24) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1042040595 and 1042040604.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 383020 + ... + 385730.
It is an arithmetic number, because the mean of its divisors is an integer number (37075752).
Almost surely, 21042040625 is an apocalyptic number.
1042040625 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1042040625 is a deficient number, since it is larger than the sum of its proper divisors (737595471).
1042040625 is an frugal number, since it uses more digits than its factorization.
1042040625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2780 (or 2760 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 1042040625 is about 32280.6540361251. The cubic root of 1042040625 is about 1013.8216242220.
The spelling of 1042040625 in words is "one billion, forty-two million, forty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •