Base | Representation |
---|---|
bin | 111100111000000… |
… | …1110111111110001 |
3 | 12021100200021102121 |
4 | 1321300032333301 |
5 | 13140411444343 |
6 | 534405514241 |
7 | 101422362031 |
oct | 17160167761 |
9 | 5240607377 |
10 | 2042687473 |
11 | 959053372 |
12 | 490112981 |
13 | 267272218 |
14 | 15540b8c1 |
15 | be4e5aed |
hex | 79c0eff1 |
2042687473 has 4 divisors (see below), whose sum is σ = 2150197360. Its totient is φ = 1935177588.
The previous prime is 2042687461. The next prime is 2042687501. The reversal of 2042687473 is 3747862402.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 2042687473 - 217 = 2042556401 is a prime.
It is a super-2 number, since 2×20426874732 = 8345144224702251458, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2042687573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53754915 + ... + 53754952.
It is an arithmetic number, because the mean of its divisors is an integer number (537549340).
Almost surely, 22042687473 is an apocalyptic number.
It is an amenable number.
2042687473 is a deficient number, since it is larger than the sum of its proper divisors (107509887).
2042687473 is a wasteful number, since it uses less digits than its factorization.
2042687473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107509886.
The product of its (nonzero) digits is 451584, while the sum is 43.
The square root of 2042687473 is about 45196.1001968090. The cubic root of 2042687473 is about 1268.8218294228.
The spelling of 2042687473 in words is "two billion, forty-two million, six hundred eighty-seven thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •