Base | Representation |
---|---|
bin | 111111111001100… |
… | …110101000010010 |
3 | 2202201021112202200 |
4 | 333321212220102 |
5 | 4143422040132 |
6 | 254214024030 |
7 | 35365255026 |
oct | 7771465022 |
9 | 2681245680 |
10 | 1072065042 |
11 | 500175374 |
12 | 25b048016 |
13 | 14114c919 |
14 | a254a386 |
15 | 641b8d7c |
hex | 3fe66a12 |
1072065042 has 24 divisors (see below), whose sum is σ = 2326708800. Its totient is φ = 356754840.
The previous prime is 1072065023. The next prime is 1072065053. The reversal of 1072065042 is 2405602701.
1072065042 is a `hidden beast` number, since 1 + 0 + 7 + 2 + 0 + 650 + 4 + 2 = 666.
It is a super-2 number, since 2×10720650422 = 2298646908556923528, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1072064997 and 1072065015.
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 11 ways as a sum of consecutive naturals, for example, 38934 + ... + 60497.
It is an arithmetic number, because the mean of its divisors is an integer number (96946200).
Almost surely, 21072065042 is an apocalyptic number.
1072065042 is an abundant number, since it is smaller than the sum of its proper divisors (1254643758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1072065042 is a wasteful number, since it uses less digits than its factorization.
1072065042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100038 (or 100035 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 1072065042 is about 32742.4043405490. The cubic root of 1072065042 is about 1023.4666876498.
Adding to 1072065042 its reverse (2405602701), we get a palindrome (3477667743).
The spelling of 1072065042 in words is "one billion, seventy-two million, sixty-five thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •