Base | Representation |
---|---|
bin | 101101011110011000101101… |
… | …000000100000001010110110 |
3 | 222020010211110222010111022120 |
4 | 231132120231000200022312 |
5 | 202203300403231241042 |
6 | 1545210454031340410 |
7 | 60061352312144112 |
oct | 5536305500401266 |
9 | 866124428114276 |
10 | 200000202212022 |
11 | 587a9678177223 |
12 | 1a521467081706 |
13 | 8779c2713bc74 |
14 | 37560c0820742 |
15 | 181c6e6bd3dec |
hex | b5e62d0202b6 |
200000202212022 has 16 divisors (see below), whose sum is σ = 401072791571760. Its totient is φ = 66488002879392.
The previous prime is 200000202212021. The next prime is 200000202212039. The reversal of 200000202212022 is 220212202000002.
It is a super-5 number, since 5×2000002022120225 (a number of 73 digits) contains 55555 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200000202211992 and 200000202212010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200000202212021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44682795397 + ... + 44682799872.
It is an arithmetic number, because the mean of its divisors is an integer number (25067049473235).
Almost surely, 2200000202212022 is an apocalyptic number.
200000202212022 is an abundant number, since it is smaller than the sum of its proper divisors (201072589359738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200000202212022 is a wasteful number, since it uses less digits than its factorization.
200000202212022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89365595647.
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 200000202212022 its reverse (220212202000002), we get a palindrome (420212404212024).
The spelling of 200000202212022 in words is "two hundred trillion, two hundred two million, two hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •