Base | Representation |
---|---|
bin | 111100110111100… |
… | …1100100001101111 |
3 | 12021100011102221222 |
4 | 1321233030201233 |
5 | 13140324241330 |
6 | 534400013555 |
7 | 101420146211 |
oct | 17157144157 |
9 | 5240142858 |
10 | 2042415215 |
11 | 958987865 |
12 | 4900012bb |
13 | 2671a8319 |
14 | 15537a5b1 |
15 | be4900e5 |
hex | 79bcc86f |
2042415215 has 4 divisors (see below), whose sum is σ = 2450898264. Its totient is φ = 1633932168.
The previous prime is 2042415211. The next prime is 2042415227. The reversal of 2042415215 is 5125142402.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5125142402 = 2 ⋅2562571201.
It is a cyclic number.
It is not a de Polignac number, because 2042415215 - 22 = 2042415211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2042415211) 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, 204241517 + ... + 204241526.
It is an arithmetic number, because the mean of its divisors is an integer number (612724566).
Almost surely, 22042415215 is an apocalyptic number.
2042415215 is a deficient number, since it is larger than the sum of its proper divisors (408483049).
2042415215 is an equidigital number, since it uses as much as digits as its factorization.
2042415215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408483048.
The product of its (nonzero) digits is 3200, while the sum is 26.
The square root of 2042415215 is about 45193.0881330320. The cubic root of 2042415215 is about 1268.7654556102.
Adding to 2042415215 its reverse (5125142402), we get a palindrome (7167557617).
The spelling of 2042415215 in words is "two billion, forty-two million, four hundred fifteen thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •