Base | Representation |
---|---|
bin | 1001001001100100011011… |
… | …01001010001011011010011 |
3 | 2122020110020121200202211000 |
4 | 10210302031221101123103 |
5 | 10114121231311034303 |
6 | 110443000223353043 |
7 | 4144423302411354 |
oct | 444621551213323 |
9 | 78213217622730 |
10 | 20120003221203 |
11 | 6457933322306 |
12 | 230b484452783 |
13 | b2c401058332 |
14 | 4d7b55ba1d2b |
15 | 24d57a275da3 |
hex | 124c8da516d3 |
20120003221203 has 16 divisors (see below), whose sum is σ = 30534422234400. Its totient is φ = 13086180956160.
The previous prime is 20120003221169. The next prime is 20120003221217. The reversal of 20120003221203 is 30212230002102.
20120003221203 is a `hidden beast` number, since 20 + 1 + 200 + 0 + 322 + 120 + 3 = 666.
It is not a de Polignac number, because 20120003221203 - 230 = 20118929479379 is a prime.
It is a super-2 number, since 2×201200032212032 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20120003221103) 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, 9087624558 + ... + 9087626771.
It is an arithmetic number, because the mean of its divisors is an integer number (1908401389650).
Almost surely, 220120003221203 is an apocalyptic number.
20120003221203 is a deficient number, since it is larger than the sum of its proper divisors (10414419013197).
20120003221203 is a wasteful number, since it uses less digits than its factorization.
20120003221203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18175251379 (or 18175251373 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 20120003221203 its reverse (30212230002102), we get a palindrome (50332233223305).
The spelling of 20120003221203 in words is "twenty trillion, one hundred twenty billion, three million, two hundred twenty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •