Base | Representation |
---|---|
bin | 111100111001001… |
… | …0110110111110111 |
3 | 12021101201112212120 |
4 | 1321302112313313 |
5 | 13141032302043 |
6 | 534425451023 |
7 | 101430200442 |
oct | 17162266767 |
9 | 5241645776 |
10 | 2043244023 |
11 | 9593a3527 |
12 | 490340a73 |
13 | 267408642 |
14 | 155514659 |
15 | be5a5983 |
hex | 79c96df7 |
2043244023 has 4 divisors (see below), whose sum is σ = 2724325368. Its totient is φ = 1362162680.
The previous prime is 2043243977. The next prime is 2043244033. The reversal of 2043244023 is 3204423402.
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 2043244023 - 26 = 2043243959 is a prime.
It is a super-2 number, since 2×20432440232 = 8349692275050449058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2043243984 and 2043244002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2043244033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 340540668 + ... + 340540673.
It is an arithmetic number, because the mean of its divisors is an integer number (681081342).
Almost surely, 22043244023 is an apocalyptic number.
2043244023 is a deficient number, since it is larger than the sum of its proper divisors (681081345).
2043244023 is an equidigital number, since it uses as much as digits as its factorization.
2043244023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681081344.
The product of its (nonzero) digits is 4608, while the sum is 24.
The square root of 2043244023 is about 45202.2568352510. The cubic root of 2043244023 is about 1268.9370532272.
Adding to 2043244023 its reverse (3204423402), we get a palindrome (5247667425).
The spelling of 2043244023 in words is "two billion, forty-three million, two hundred forty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •