Base | Representation |
---|---|
bin | 11111100111001000… |
… | …010011011000001001 |
3 | 10020121111202212101011 |
4 | 133213020103120021 |
5 | 1024003234000424 |
6 | 23332025123521 |
7 | 2311061233504 |
oct | 374710233011 |
9 | 106544685334 |
10 | 33942484489 |
11 | 13438713a81 |
12 | 66b33295a1 |
13 | 327c0c9664 |
14 | 18ddcaa13b |
15 | d39cdc694 |
hex | 7e7213609 |
33942484489 has 8 divisors (see below), whose sum is σ = 34084512000. Its totient is φ = 33800754000.
The previous prime is 33942484483. The next prime is 33942484517. The reversal of 33942484489 is 98448424933.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 33942484489 - 23 = 33942484481 is a prime.
It is a super-2 number, since 2×339424844892 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (33942484481) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 156264 + ... + 303814.
It is an arithmetic number, because the mean of its divisors is an integer number (4260564000).
Almost surely, 233942484489 is an apocalyptic number.
It is an amenable number.
33942484489 is a deficient number, since it is larger than the sum of its proper divisors (142027511).
33942484489 is a wasteful number, since it uses less digits than its factorization.
33942484489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148511.
The product of its digits is 23887872, while the sum is 58.
It can be divided in two parts, 339424844 and 89, that added together give a palindrome (339424933).
The spelling of 33942484489 in words is "thirty-three billion, nine hundred forty-two million, four hundred eighty-four thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •