Base | Representation |
---|---|
bin | 100000000001000001100… |
… | …011101100010011101001 |
3 | 21210022220100211020121002 |
4 | 200001001203230103221 |
5 | 242021323010143423 |
6 | 4402420030124345 |
7 | 314645050023635 |
oct | 40010143542351 |
9 | 7708810736532 |
10 | 2200123131113 |
11 | 779081172236 |
12 | 2b64949506b5 |
13 | 12c61723569b |
14 | 786b5063dc5 |
15 | 3c36c175228 |
hex | 200418ec4e9 |
2200123131113 has 4 divisors (see below), whose sum is σ = 2200277854788. Its totient is φ = 2199968407440.
The previous prime is 2200123131083. The next prime is 2200123131119. The reversal of 2200123131113 is 3111313210022.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1795407045184 + 404716085929 = 1339928^2 + 636173^2 .
It is a cyclic number.
It is not a de Polignac number, because 2200123131113 - 212 = 2200123127017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2200123131119) 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, 77340506 + ... + 77368947.
It is an arithmetic number, because the mean of its divisors is an integer number (550069463697).
Almost surely, 22200123131113 is an apocalyptic number.
It is an amenable number.
2200123131113 is a deficient number, since it is larger than the sum of its proper divisors (154723675).
2200123131113 is a wasteful number, since it uses less digits than its factorization.
2200123131113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154723674.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2200123131113 its reverse (3111313210022), we get a palindrome (5311436341135).
The spelling of 2200123131113 in words is "two trillion, two hundred billion, one hundred twenty-three million, one hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •