Base | Representation |
---|---|
bin | 1011000000011011111000… |
… | …0101101000101011010011 |
3 | 1120211221122222212020110200 |
4 | 2300012332011220223103 |
5 | 3041240111134134303 |
6 | 41423344501030243 |
7 | 2356230421613151 |
oct | 260067605505323 |
9 | 46757588766420 |
10 | 12102112021203 |
11 | 3946527809776 |
12 | 14355789b5383 |
13 | 69a2bb9389c9 |
14 | 2dba613383d1 |
15 | 15ec0c7993a3 |
hex | b01be168ad3 |
12102112021203 has 12 divisors (see below), whose sum is σ = 17614269915528. Its totient is φ = 8006486323680.
The previous prime is 12102112021189. The next prime is 12102112021211. The reversal of 12102112021203 is 30212021120121.
12102112021203 is a `hidden beast` number, since 1 + 210 + 211 + 20 + 21 + 203 = 666.
It is not a de Polignac number, because 12102112021203 - 210 = 12102112020179 is a prime.
It is a super-2 number, since 2×121021120212032 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12102112021243) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5132361850 + ... + 5132364207.
It is an arithmetic number, because the mean of its divisors is an integer number (1467855826294).
Almost surely, 212102112021203 is an apocalyptic number.
12102112021203 is a deficient number, since it is larger than the sum of its proper divisors (5512157894325).
12102112021203 is a wasteful number, since it uses less digits than its factorization.
12102112021203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10264726194 (or 10264726191 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 12102112021203 its reverse (30212021120121), we get a palindrome (42314133141324).
The spelling of 12102112021203 in words is "twelve trillion, one hundred two billion, one hundred twelve million, twenty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •