Base | Representation |
---|---|
bin | 11110110111100001111… |
… | …110110000110001000011 |
3 | 21111210012210020011011101 |
4 | 132313201332300301003 |
5 | 234223214303000303 |
6 | 4302245344155231 |
7 | 306152365142500 |
oct | 36674176606103 |
9 | 7453183204141 |
10 | 2121210203203 |
11 | 748666950543 |
12 | 2a3131008b17 |
13 | 12504c3a60c0 |
14 | 7494a8204a7 |
15 | 3a29e336d1d |
hex | 1ede1fb0c43 |
2121210203203 has 12 divisors (see below), whose sum is σ = 2657340255360. Its totient is φ = 1678320160272.
The previous prime is 2121210203191. The next prime is 2121210203207. The reversal of 2121210203203 is 3023020121212.
It is not a de Polignac number, because 2121210203203 - 25 = 2121210203171 is a prime.
It is a super-3 number, since 3×21212102032033 (a number of 38 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (2121210203207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1664999523 + ... + 1665000796.
It is an arithmetic number, because the mean of its divisors is an integer number (221445021280).
Almost surely, 22121210203203 is an apocalyptic number.
2121210203203 is a deficient number, since it is larger than the sum of its proper divisors (536130052157).
2121210203203 is a wasteful number, since it uses less digits than its factorization.
2121210203203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3330000346 (or 3330000339 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 2121210203203 its reverse (3023020121212), we get a palindrome (5144230324415).
The spelling of 2121210203203 in words is "two trillion, one hundred twenty-one billion, two hundred ten million, two hundred three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •