Base | Representation |
---|---|
bin | 1011000000011111001100… |
… | …0101001111101000111101 |
3 | 1120212000221221211200112011 |
4 | 2300013303011033220331 |
5 | 3041243421241023401 |
6 | 41424013021211221 |
7 | 2356261436012035 |
oct | 260076305175075 |
9 | 46760857750464 |
10 | 12103001111101 |
11 | 394694366a10a |
12 | 1435786700b11 |
13 | 69a400bb24c4 |
14 | 2dbb074548c5 |
15 | 15ec6086d451 |
hex | b01f314fa3d |
12103001111101 has 8 divisors (see below), whose sum is σ = 12760191358400. Its totient is φ = 11447829882720.
The previous prime is 12103001111023. The next prime is 12103001111153. The reversal of 12103001111101 is 10111110030121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12103001111101 - 27 = 12103001110973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12103001117101) 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 7 ways as a sum of consecutive naturals, for example, 504742416 + ... + 504766393.
It is an arithmetic number, because the mean of its divisors is an integer number (1595023919800).
Almost surely, 212103001111101 is an apocalyptic number.
It is an amenable number.
12103001111101 is a deficient number, since it is larger than the sum of its proper divisors (657190247299).
12103001111101 is a wasteful number, since it uses less digits than its factorization.
12103001111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009509459.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 12103001111101 its reverse (10111110030121), we get a palindrome (22214111141222).
The spelling of 12103001111101 in words is "twelve trillion, one hundred three billion, one million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •