Base | Representation |
---|---|
bin | 101101100001010011110011… |
… | …100001010111000110100110 |
3 | 222020212001000222001000020012 |
4 | 231201103303201113012212 |
5 | 202220043323402210042 |
6 | 1545443041034210222 |
7 | 60112023630354413 |
oct | 5541236341270646 |
9 | 866761028030205 |
10 | 200201101210022 |
11 | 588768a0445980 |
12 | 1a554393883972 |
13 | 8792b62793703 |
14 | 3761adc07b10a |
15 | 1822a54037e82 |
hex | b614f38571a6 |
200201101210022 has 16 divisors (see below), whose sum is σ = 328032290577744. Its totient is φ = 90880920384000.
The previous prime is 200201101209997. The next prime is 200201101210031. The reversal of 200201101210022 is 220012101102002.
200201101210022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 200201101209979 and 200201101210006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5978991179 + ... + 5979024662.
It is an arithmetic number, because the mean of its divisors is an integer number (20502018161109).
Almost surely, 2200201101210022 is an apocalyptic number.
200201101210022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
200201101210022 is a deficient number, since it is larger than the sum of its proper divisors (127831189367722).
200201101210022 is a wasteful number, since it uses less digits than its factorization.
200201101210022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11958016615.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 200201101210022 its reverse (220012101102002), we get a palindrome (420213202312024).
The spelling of 200201101210022 in words is "two hundred trillion, two hundred one billion, one hundred one million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •