Base | Representation |
---|---|
bin | 1011010101010111… |
… | …1010010101000000 |
3 | 21212000211221200102 |
4 | 2311111322111000 |
5 | 22212324420112 |
6 | 1221521341532 |
7 | 135252100151 |
oct | 26525722500 |
9 | 7760757612 |
10 | 3042420032 |
11 | 1321404223 |
12 | 70aa978a8 |
13 | 396417752 |
14 | 20c0c9928 |
15 | 12c172bc2 |
hex | b557a540 |
3042420032 has 14 divisors (see below), whose sum is σ = 6037302378. Its totient is φ = 1521209984.
The previous prime is 3042419999. The next prime is 3042420037. The reversal of 3042420032 is 2300242403.
It can be written as a sum of positive squares in only one way, i.e., 2274908416 + 767511616 = 47696^2 + 27704^2 .
It is a super-2 number, since 2×30424200322 = 18512639302229762048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3042419986 and 3042420013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3042420037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23768843 + ... + 23768970.
Almost surely, 23042420032 is an apocalyptic number.
3042420032 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
3042420032 is a deficient number, since it is larger than the sum of its proper divisors (2994882346).
3042420032 is an equidigital number, since it uses as much as digits as its factorization.
3042420032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47537825 (or 47537815 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 20.
The square root of 3042420032 is about 55158.1365892649. The cubic root of 3042420032 is about 1449.0155873971.
Adding to 3042420032 its reverse (2300242403), we get a palindrome (5342662435).
The spelling of 3042420032 in words is "three billion, forty-two million, four hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •