Base | Representation |
---|---|
bin | 1011101010101000011… |
… | …1110110001000001011 |
3 | 201011022210122000011002 |
4 | 2322222013312020023 |
5 | 11240431201212201 |
6 | 232023425325215 |
7 | 20323442443310 |
oct | 2725207661013 |
9 | 634283560132 |
10 | 200422679051 |
11 | 77aa9417231 |
12 | 32a1519680b |
13 | 15b90a7141a |
14 | 99b42aad07 |
15 | 533061776b |
hex | 2eaa1f620b |
200422679051 has 8 divisors (see below), whose sum is σ = 231081522144. Its totient is φ = 170270593920.
The previous prime is 200422679047. The next prime is 200422679063. The reversal of 200422679051 is 150976224002.
200422679051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200422679051 - 22 = 200422679047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200422678996 and 200422679014.
It is not an unprimeable number, because it can be changed into a prime (200422679011) 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 7 ways as a sum of consecutive naturals, for example, 126688640 + ... + 126690221.
It is an arithmetic number, because the mean of its divisors is an integer number (28885190268).
Almost surely, 2200422679051 is an apocalyptic number.
200422679051 is a deficient number, since it is larger than the sum of its proper divisors (30658843093).
200422679051 is a wasteful number, since it uses less digits than its factorization.
200422679051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253378981.
The product of its (nonzero) digits is 60480, while the sum is 38.
The spelling of 200422679051 in words is "two hundred billion, four hundred twenty-two million, six hundred seventy-nine thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •