Base | Representation |
---|---|
bin | 101101011110011010100101… |
… | …010101111100111111001001 |
3 | 222020011000200200000200100110 |
4 | 231132122211111330333021 |
5 | 202203314022100213001 |
6 | 1545211430231224533 |
7 | 60061453325336604 |
oct | 5536324525747711 |
9 | 866130620020313 |
10 | 200002221101001 |
11 | 587aa513845410 |
12 | 1a52192b218149 |
13 | 877a18949ab27 |
14 | 37562329d533b |
15 | 181c7b40783d6 |
hex | b5e6a557cfc9 |
200002221101001 has 64 divisors (see below), whose sum is σ = 311587093979136. Its totient is φ = 112767621504000.
The previous prime is 200002221100931. The next prime is 200002221101101. The reversal of 200002221101001 is 100101122200002.
It is not a de Polignac number, because 200002221101001 - 218 = 200002220838857 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200002221101101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 31485646 + ... + 37300808.
It is an arithmetic number, because the mean of its divisors is an integer number (4868548343424).
Almost surely, 2200002221101001 is an apocalyptic number.
It is an amenable number.
200002221101001 is a deficient number, since it is larger than the sum of its proper divisors (111584872878135).
200002221101001 is a wasteful number, since it uses less digits than its factorization.
200002221101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5815902.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 200002221101001 its reverse (100101122200002), we get a palindrome (300103343301003).
The spelling of 200002221101001 in words is "two hundred trillion, two billion, two hundred twenty-one million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •