Base | Representation |
---|---|
bin | 111110000111011… |
… | …010010001110010 |
3 | 2200121221200122200 |
4 | 332013122101302 |
5 | 4113241130114 |
6 | 251224244030 |
7 | 34552646661 |
oct | 7607322162 |
9 | 2617850580 |
10 | 1042130034 |
11 | 4952897a0 |
12 | 251010616 |
13 | 137b9b3ba |
14 | 9c596dd8 |
15 | 61754409 |
hex | 3e1da472 |
1042130034 has 72 divisors (see below), whose sum is σ = 2491633872. Its totient is φ = 312193440.
The previous prime is 1042130003. The next prime is 1042130041. The reversal of 1042130034 is 4300312401.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1042129989 and 1042130016.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2352217 + ... + 2352659.
It is an arithmetic number, because the mean of its divisors is an integer number (34606026).
Almost surely, 21042130034 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1042130034, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1245816936).
1042130034 is an abundant number, since it is smaller than the sum of its proper divisors (1449503838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1042130034 is a wasteful number, since it uses less digits than its factorization.
1042130034 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 680 (or 568 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 1042130034 is about 32282.0388761305. The cubic root of 1042130034 is about 1013.8506193120.
Adding to 1042130034 its reverse (4300312401), we get a palindrome (5342442435).
The spelling of 1042130034 in words is "one billion, forty-two million, one hundred thirty thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •