Base | Representation |
---|---|
bin | 101101100001010100101111… |
… | …000111010011011000110110 |
3 | 222020212010121122100012201220 |
4 | 231201110233013103120312 |
5 | 202220102400324341042 |
6 | 1545443324151331210 |
7 | 60112060460502144 |
oct | 5541245707233066 |
9 | 866763548305656 |
10 | 200202101012022 |
11 | 58877263843a1a |
12 | 1a554612680b06 |
13 | 8792c91961725 |
14 | 3761b94b76594 |
15 | 1822ab1bca8ec |
hex | b6152f1d3636 |
200202101012022 has 8 divisors (see below), whose sum is σ = 400404202024056. Its totient is φ = 66734033670672.
The previous prime is 200202101011987. The next prime is 200202101012033. The reversal of 200202101012022 is 220210101202002.
It is a sphenic number, since it is the product of 3 distinct primes.
200202101012022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 200202101011992 and 200202101012010.
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, 16683508417663 + ... + 16683508417674.
It is an arithmetic number, because the mean of its divisors is an integer number (50050525253007).
Almost surely, 2200202101012022 is an apocalyptic number.
200202101012022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200202101012022 is a wasteful number, since it uses less digits than its factorization.
200202101012022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33367016835342.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200202101012022 its reverse (220210101202002), we get a palindrome (420412202214024).
The spelling of 200202101012022 in words is "two hundred trillion, two hundred two billion, one hundred one million, twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •