Base | Representation |
---|---|
bin | 101101011110101101000000… |
… | …110111011010011011100101 |
3 | 222020012220202210201120120011 |
4 | 231132231000313122123211 |
5 | 202204130034103210041 |
6 | 1545224502024410221 |
7 | 60063053610106156 |
oct | 5536550067323345 |
9 | 866186683646504 |
10 | 200022010210021 |
11 | 5880794922296a |
12 | 1a525732616971 |
13 | 877bcc12771ac |
14 | 375718cca192d |
15 | 181d071537e81 |
hex | b5eb40dda6e5 |
200022010210021 has 16 divisors (see below), whose sum is σ = 207738288307264. Its totient is φ = 192445306631424.
The previous prime is 200022010209997. The next prime is 200022010210067. The reversal of 200022010210021 is 120012010220002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 200022010210021 - 27 = 200022010209893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200022010209983 and 200022010210010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200022010210091) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 60022381 + ... + 63267133.
It is an arithmetic number, because the mean of its divisors is an integer number (12983643019204).
Almost surely, 2200022010210021 is an apocalyptic number.
It is an amenable number.
200022010210021 is a deficient number, since it is larger than the sum of its proper divisors (7716278097243).
200022010210021 is a wasteful number, since it uses less digits than its factorization.
200022010210021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3266260.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200022010210021 its reverse (120012010220002), we get a palindrome (320034020430023).
The spelling of 200022010210021 in words is "two hundred trillion, twenty-two billion, ten million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •