Base | Representation |
---|---|
bin | 101101100100110010010100… |
… | …010011111001000001101101 |
3 | 222021200212201202200021212110 |
4 | 231210302110103321001231 |
5 | 202233002131113341023 |
6 | 1550144512552154233 |
7 | 60135212412565350 |
oct | 5544622423710155 |
9 | 867625652607773 |
10 | 200440022012013 |
11 | 58959154a68733 |
12 | 1a592751998979 |
13 | 87ac54a3b8924 |
14 | 376d4c5284297 |
15 | 1828d8936ba93 |
hex | b64c944f906d |
200440022012013 has 32 divisors (see below), whose sum is σ = 306615274418176. Its totient is φ = 114093799380288.
The previous prime is 200440022011981. The next prime is 200440022012033. The reversal of 200440022012013 is 310210220044002.
It is not a de Polignac number, because 200440022012013 - 25 = 200440022011981 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200440022012033) 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, 17731770 + ... + 26745012.
It is an arithmetic number, because the mean of its divisors is an integer number (9581727325568).
Almost surely, 2200440022012013 is an apocalyptic number.
It is an amenable number.
200440022012013 is a deficient number, since it is larger than the sum of its proper divisors (106175252406163).
200440022012013 is a wasteful number, since it uses less digits than its factorization.
200440022012013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9017353.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 200440022012013 its reverse (310210220044002), we get a palindrome (510650242056015).
The spelling of 200440022012013 in words is "two hundred trillion, four hundred forty billion, twenty-two million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •