Base | Representation |
---|---|
bin | 101101100001101001001001… |
… | …000100000101001010010101 |
3 | 222020221020011121020122221020 |
4 | 231201221021010011022111 |
5 | 202220432233332231123 |
6 | 1545501350235111353 |
7 | 60113464436225400 |
oct | 5541511104051225 |
9 | 866836147218836 |
10 | 200224011211413 |
11 | 58885587555022 |
12 | 1a5589082a2559 |
13 | 8795074001457 |
14 | 3762c72a1cd37 |
15 | 18234454bb7e3 |
hex | b61a49105295 |
200224011211413 has 24 divisors (see below), whose sum is σ = 310571429372352. Its totient is φ = 114406388457984.
The previous prime is 200224011211409. The next prime is 200224011211439. The reversal of 200224011211413 is 314112110422002.
It is not a de Polignac number, because 200224011211413 - 22 = 200224011211409 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200224011211613) 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 23 ways as a sum of consecutive naturals, for example, 41342220 + ... + 45930677.
It is an arithmetic number, because the mean of its divisors is an integer number (12940476223848).
Almost surely, 2200224011211413 is an apocalyptic number.
It is an amenable number.
200224011211413 is a deficient number, since it is larger than the sum of its proper divisors (110347418160939).
200224011211413 is a wasteful number, since it uses less digits than its factorization.
200224011211413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87288521 (or 87288514 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 200224011211413 its reverse (314112110422002), we get a palindrome (514336121633415).
The spelling of 200224011211413 in words is "two hundred trillion, two hundred twenty-four billion, eleven million, two hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •