Base | Representation |
---|---|
bin | 111110001000110… |
… | …110110101000010 |
3 | 2200122122221122222 |
4 | 332020312311002 |
5 | 4113340242442 |
6 | 251240331042 |
7 | 34556116124 |
oct | 7610666502 |
9 | 2618587588 |
10 | 1042509122 |
11 | 495518596 |
12 | 251173a82 |
13 | 137ca1b05 |
14 | 9c655214 |
15 | 617cb8d2 |
hex | 3e236d42 |
1042509122 has 30 divisors (see below), whose sum is σ = 1682795583. Its totient is φ = 484382496.
The previous prime is 1042509121. The next prime is 1042509161. The reversal of 1042509122 is 2219052401.
1042509122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 1003559041 + 38950081 = 31679^2 + 6241^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=22831.
It is a hoax number, since the sum of its digits (26) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1042509091 and 1042509100.
It is not an unprimeable number, because it can be changed into a prime (1042509121) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 13196279 + ... + 13196357.
Almost surely, 21042509122 is an apocalyptic number.
1042509122 is a deficient number, since it is larger than the sum of its proper divisors (640286461).
1042509122 is an frugal number, since it uses more digits than its factorization.
1042509122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228 (or 98 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 1042509122 is about 32287.9098425401. The cubic root of 1042509122 is about 1013.9735380770.
The spelling of 1042509122 in words is "one billion, forty-two million, five hundred nine thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •