Base | Representation |
---|---|
bin | 101101011110011001011101… |
… | …111000001000011000011110 |
3 | 222020010220121002220011120211 |
4 | 231132121131320020120132 |
5 | 202203304043124213042 |
6 | 1545211111240403034 |
7 | 60061411526115052 |
oct | 5536313570103036 |
9 | 866126532804524 |
10 | 200001022101022 |
11 | 587a9a58a61a3a |
12 | 1a52165577647a |
13 | 877a027c6689c |
14 | 375615b685c62 |
15 | 181c743b89017 |
hex | b5e65de0861e |
200001022101022 has 8 divisors (see below), whose sum is σ = 301524383574216. Its totient is φ = 99492894242952.
The previous prime is 200001022100981. The next prime is 200001022101053. The reversal of 200001022101022 is 220101220100002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 200001022100993 and 200001022101011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 253808403288 + ... + 253808404075.
It is an arithmetic number, because the mean of its divisors is an integer number (37690547946777).
Almost surely, 2200001022101022 is an apocalyptic number.
200001022101022 is a deficient number, since it is larger than the sum of its proper divisors (101523361473194).
200001022101022 is a wasteful number, since it uses less digits than its factorization.
200001022101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 507616807562.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200001022101022 its reverse (220101220100002), we get a palindrome (420102242201024).
The spelling of 200001022101022 in words is "two hundred trillion, one billion, twenty-two million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •