Base | Representation |
---|---|
bin | 111100110111000… |
… | …1001101001110111 |
3 | 12021022122112020002 |
4 | 1321232021221313 |
5 | 13140242010203 |
6 | 534350101515 |
7 | 101414625506 |
oct | 17156115167 |
9 | 5238575202 |
10 | 2042141303 |
11 | 95880aa94 |
12 | 48baaa89b |
13 | 267110747 |
14 | 15530883d |
15 | be438d88 |
hex | 79b89a77 |
2042141303 has 8 divisors (see below), whose sum is σ = 2163121488. Its totient is φ = 1921256064.
The previous prime is 2042141279. The next prime is 2042141341. The reversal of 2042141303 is 3031412402.
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 2042141303 - 210 = 2042140279 is a prime.
It is a super-2 number, since 2×20421413032 = 8340682202837075618, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2042141393) 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 7 ways as a sum of consecutive naturals, for example, 23225 + ... + 67997.
It is an arithmetic number, because the mean of its divisors is an integer number (270390186).
Almost surely, 22042141303 is an apocalyptic number.
2042141303 is a deficient number, since it is larger than the sum of its proper divisors (120980185).
2042141303 is a wasteful number, since it uses less digits than its factorization.
2042141303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47473.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 2042141303 is about 45190.0575680094. The cubic root of 2042141303 is about 1268.7087342642.
Adding to 2042141303 its reverse (3031412402), we get a palindrome (5073553705).
The spelling of 2042141303 in words is "two billion, forty-two million, one hundred forty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •