Base | Representation |
---|---|
bin | 1001001101001011110011… |
… | …10001111100100011000011 |
3 | 2122200022212210000021102011 |
4 | 10212211321301330203003 |
5 | 10123140132321032433 |
6 | 111020022414033351 |
7 | 4156411512546013 |
oct | 446457161744303 |
9 | 78608783007364 |
10 | 20244224002243 |
11 | 64a558875771a |
12 | 232b5717a8857 |
13 | b3b039816177 |
14 | 4ddb7b8cdc43 |
15 | 2518eaa633cd |
hex | 126979c7c8c3 |
20244224002243 has 4 divisors (see below), whose sum is σ = 20250824665240. Its totient is φ = 20237623339248.
The previous prime is 20244224002237. The next prime is 20244224002259. The reversal of 20244224002243 is 34220042244202.
It is a happy number.
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 20244224002243 - 217 = 20244223871171 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20244234002243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3300326898 + ... + 3300333031.
It is an arithmetic number, because the mean of its divisors is an integer number (5062706166310).
Almost surely, 220244224002243 is an apocalyptic number.
20244224002243 is a deficient number, since it is larger than the sum of its proper divisors (6600662997).
20244224002243 is an equidigital number, since it uses as much as digits as its factorization.
20244224002243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6600662996.
The product of its (nonzero) digits is 49152, while the sum is 31.
Adding to 20244224002243 its reverse (34220042244202), we get a palindrome (54464266246445).
The spelling of 20244224002243 in words is "twenty trillion, two hundred forty-four billion, two hundred twenty-four million, two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •