Base | Representation |
---|---|
bin | 101101011110101100001011… |
… | …010101011001110001110011 |
3 | 222020012211110012202221222020 |
4 | 231132230023111121301303 |
5 | 202204121214144231003 |
6 | 1545224232543042523 |
7 | 60063022423240353 |
oct | 5536541325316163 |
9 | 866184405687866 |
10 | 200021112102003 |
11 | 58807528273035 |
12 | 1a5255218a0443 |
13 | 877bbaa193a2a |
14 | 37571058b8b63 |
15 | 181d01c781d53 |
hex | b5eb0b559c73 |
200021112102003 has 16 divisors (see below), whose sum is σ = 285333539270400. Its totient is φ = 124258154194080.
The previous prime is 200021112101989. The next prime is 200021112102013. The reversal of 200021112102003 is 300201211120002.
It is not a de Polignac number, because 200021112102003 - 217 = 200021111970931 is a prime.
It is a super-2 number, since 2×2000211121020032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200021112102013) 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, 28763458143 + ... + 28763465096.
It is an arithmetic number, because the mean of its divisors is an integer number (17833346204400).
Almost surely, 2200021112102003 is an apocalyptic number.
200021112102003 is a deficient number, since it is larger than the sum of its proper divisors (85312427168397).
200021112102003 is a wasteful number, since it uses less digits than its factorization.
200021112102003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57526923322.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 200021112102003 its reverse (300201211120002), we get a palindrome (500222323222005).
The spelling of 200021112102003 in words is "two hundred trillion, twenty-one billion, one hundred twelve million, one hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •