Base | Representation |
---|---|
bin | 100000101000001001111… |
… | …110000101110001101011 |
3 | 21221100100121100111111020 |
4 | 200220021332011301223 |
5 | 243213400342400133 |
6 | 4434005221503523 |
7 | 320663216150112 |
oct | 40501176056153 |
9 | 7840317314436 |
10 | 2242140200043 |
11 | 794982765a97 |
12 | 302660271ba3 |
13 | 13358215a553 |
14 | 7a73d490c79 |
15 | 3d4cac920b3 |
hex | 20a09f85c6b |
2242140200043 has 4 divisors (see below), whose sum is σ = 2989520266728. Its totient is φ = 1494760133360.
The previous prime is 2242140199997. The next prime is 2242140200101. The reversal of 2242140200043 is 3400020412422.
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 2242140200043 - 218 = 2242139937899 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2242140199986 and 2242140200022.
It is not an unprimeable number, because it can be changed into a prime (2242140201043) 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, 373690033338 + ... + 373690033343.
It is an arithmetic number, because the mean of its divisors is an integer number (747380066682).
Almost surely, 22242140200043 is an apocalyptic number.
2242140200043 is a deficient number, since it is larger than the sum of its proper divisors (747380066685).
2242140200043 is an equidigital number, since it uses as much as digits as its factorization.
2242140200043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 747380066684.
The product of its (nonzero) digits is 3072, while the sum is 24.
Adding to 2242140200043 its reverse (3400020412422), we get a palindrome (5642160612465).
The spelling of 2242140200043 in words is "two trillion, two hundred forty-two billion, one hundred forty million, two hundred thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •