Base | Representation |
---|---|
bin | 101101100001101001011011… |
… | …000001000110011010101101 |
3 | 222020221020221121000122110022 |
4 | 231201221123001012122231 |
5 | 202220433342434420023 |
6 | 1545501440155051525 |
7 | 60113505054400520 |
oct | 5541513301063255 |
9 | 866836847018408 |
10 | 200224312420013 |
11 | 58885721584552 |
12 | 1a558991140ba5 |
13 | 87950c15333ab |
14 | 3762ca0a28bb7 |
15 | 1823461b687c8 |
hex | b61a5b0466ad |
200224312420013 has 32 divisors (see below), whose sum is σ = 243156777742080. Its totient is φ = 160946531205120.
The previous prime is 200224312420009. The next prime is 200224312420039. The reversal of 200224312420013 is 310024213422002.
It is a cyclic number.
It is not a de Polignac number, because 200224312420013 - 22 = 200224312420009 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200224312420813) 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 31 ways as a sum of consecutive naturals, for example, 710073293 + ... + 710355213.
It is an arithmetic number, because the mean of its divisors is an integer number (7598649304440).
Almost surely, 2200224312420013 is an apocalyptic number.
It is an amenable number.
200224312420013 is a deficient number, since it is larger than the sum of its proper divisors (42932465322067).
200224312420013 is a wasteful number, since it uses less digits than its factorization.
200224312420013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303317.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 200224312420013 its reverse (310024213422002), we get a palindrome (510248525842015).
The spelling of 200224312420013 in words is "two hundred trillion, two hundred twenty-four billion, three hundred twelve million, four hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •