Base | Representation |
---|---|
bin | 100000000001000001100… |
… | …111111011011000010111 |
3 | 21210022220102220122122222 |
4 | 200001001213323120113 |
5 | 242021323301211211 |
6 | 4402420110012555 |
7 | 314645062330004 |
oct | 40010147733027 |
9 | 7708812818588 |
10 | 2200124241431 |
11 | 779081860456 |
12 | 2b64951a715b |
13 | 12c617533b8c |
14 | 786b52728ab |
15 | 3c36c2e41db |
hex | 200419fb617 |
2200124241431 has 16 divisors (see below), whose sum is σ = 2275017563520. Its totient is φ = 2126510668800.
The previous prime is 2200124241409. The next prime is 2200124241439. The reversal of 2200124241431 is 1341424210022.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2200124241431 is a prime.
It is a super-2 number, since 2×22001242414312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2200124241431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200124241439) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1250855 + ... + 2442311.
It is an arithmetic number, because the mean of its divisors is an integer number (142188597720).
Almost surely, 22200124241431 is an apocalyptic number.
2200124241431 is a deficient number, since it is larger than the sum of its proper divisors (74893322089).
2200124241431 is a wasteful number, since it uses less digits than its factorization.
2200124241431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1191994.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 2200124241431 its reverse (1341424210022), we get a palindrome (3541548451453).
The spelling of 2200124241431 in words is "two trillion, two hundred billion, one hundred twenty-four million, two hundred forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •