Base | Representation |
---|---|
bin | 111100110110110… |
… | …1010010101110011 |
3 | 12021022102000021201 |
4 | 1321231222111303 |
5 | 13140223404133 |
6 | 534343232031 |
7 | 101413552540 |
oct | 17155522563 |
9 | 5238360251 |
10 | 2042013043 |
11 | 958732694 |
12 | 48ba48617 |
13 | 267097255 |
14 | 1552b3bc7 |
15 | be410d7d |
hex | 79b6a573 |
2042013043 has 4 divisors (see below), whose sum is σ = 2333729200. Its totient is φ = 1750296888.
The previous prime is 2042012969. The next prime is 2042013053. The reversal of 2042013043 is 3403102402.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2042013043 - 229 = 1505142131 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2042013043.
It is not an unprimeable number, because it can be changed into a prime (2042013053) 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, 145858068 + ... + 145858081.
It is an arithmetic number, because the mean of its divisors is an integer number (583432300).
Almost surely, 22042013043 is an apocalyptic number.
2042013043 is a deficient number, since it is larger than the sum of its proper divisors (291716157).
2042013043 is an equidigital number, since it uses as much as digits as its factorization.
2042013043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291716156.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 2042013043 is about 45188.6384282598. The cubic root of 2042013043 is about 1268.6821726041.
Adding to 2042013043 its reverse (3403102402), we get a palindrome (5445115445).
The spelling of 2042013043 in words is "two billion, forty-two million, thirteen thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •