Base | Representation |
---|---|
bin | 101101100001010101110001… |
… | …010101110001001001111110 |
3 | 222020212020111002001100012201 |
4 | 231201111301111301021332 |
5 | 202220112134244201342 |
6 | 1545444030322022114 |
7 | 60112130141546302 |
oct | 5541256125611176 |
9 | 866766432040181 |
10 | 200203212100222 |
11 | 58877783a41a31 |
12 | 1a5548827a793a |
13 | 879310abc5376 |
14 | 3761c5c55dd02 |
15 | 1822b29501db7 |
hex | b6157157127e |
200203212100222 has 4 divisors (see below), whose sum is σ = 300304818150336. Its totient is φ = 100101606050110.
The previous prime is 200203212100201. The next prime is 200203212100223. The reversal of 200203212100222 is 222001212302002.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×2002032121002222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 200203212100222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200203212100223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50050803025054 + ... + 50050803025057.
It is an arithmetic number, because the mean of its divisors is an integer number (75076204537584).
Almost surely, 2200203212100222 is an apocalyptic number.
200203212100222 is a deficient number, since it is larger than the sum of its proper divisors (100101606050114).
200203212100222 is a wasteful number, since it uses less digits than its factorization.
200203212100222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100101606050113.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 200203212100222 its reverse (222001212302002), we get a palindrome (422204424402224).
The spelling of 200203212100222 in words is "two hundred trillion, two hundred three billion, two hundred twelve million, one hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •