Base | Representation |
---|---|
bin | 1001110101111101… |
… | …0101001101010011 |
3 | 20211010211111201121 |
4 | 2131133111031103 |
5 | 20402403024433 |
6 | 1114104143111 |
7 | 122322431443 |
oct | 23537251523 |
9 | 6733744647 |
10 | 2642236243 |
11 | 1136523219 |
12 | 618a67a97 |
13 | 3315405ca |
14 | 1b0cb8123 |
15 | 106e74c2d |
hex | 9d7d5353 |
2642236243 has 4 divisors (see below), whose sum is σ = 2651775280. Its totient is φ = 2632697208.
The previous prime is 2642236229. The next prime is 2642236249. The reversal of 2642236243 is 3426322462.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3426322462 = 2 ⋅1713161231.
It is a cyclic number.
It is not a de Polignac number, because 2642236243 - 217 = 2642105171 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2642236199 and 2642236208.
It is not an unprimeable number, because it can be changed into a prime (2642236249) 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, 4769103 + ... + 4769656.
It is an arithmetic number, because the mean of its divisors is an integer number (662943820).
Almost surely, 22642236243 is an apocalyptic number.
2642236243 is a deficient number, since it is larger than the sum of its proper divisors (9539037).
2642236243 is an equidigital number, since it uses as much as digits as its factorization.
2642236243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9539036.
The product of its digits is 82944, while the sum is 34.
The square root of 2642236243 is about 51402.6871184766. The cubic root of 2642236243 is about 1382.4747728786.
The spelling of 2642236243 in words is "two billion, six hundred forty-two million, two hundred thirty-six thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •