Base | Representation |
---|---|
bin | 1011000000011111001110… |
… | …1011011011010010110111 |
3 | 1120212000222122200012120122 |
4 | 2300013303223123102313 |
5 | 3041243431321322221 |
6 | 41424014015522155 |
7 | 2356261620050306 |
oct | 260076353332267 |
9 | 46760878605518 |
10 | 12103011120311 |
11 | 3946949286191 |
12 | 1435789b2935b |
13 | 69a402ca8307 |
14 | 2dbb088dc43d |
15 | 15ec61698eab |
hex | b01f3adb4b7 |
12103011120311 has 4 divisors (see below), whose sum is σ = 12256213792800. Its totient is φ = 11949808447824.
The previous prime is 12103011120289. The next prime is 12103011120337. The reversal of 12103011120311 is 11302111030121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12103011120311 - 218 = 12103010858167 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12103011120311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12103011120341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76601336126 + ... + 76601336283.
It is an arithmetic number, because the mean of its divisors is an integer number (3064053448200).
Almost surely, 212103011120311 is an apocalyptic number.
12103011120311 is a deficient number, since it is larger than the sum of its proper divisors (153202672489).
12103011120311 is an equidigital number, since it uses as much as digits as its factorization.
12103011120311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153202672488.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 12103011120311 its reverse (11302111030121), we get a palindrome (23405122150432).
The spelling of 12103011120311 in words is "twelve trillion, one hundred three billion, eleven million, one hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •