Base | Representation |
---|---|
bin | 1011000001000100110100… |
… | …0001100001111000111111 |
3 | 1120220000000202201110221122 |
4 | 2300101031001201320333 |
5 | 3041430112101140221 |
6 | 41432403100021155 |
7 | 2360066624226662 |
oct | 260211501417077 |
9 | 46800022643848 |
10 | 12113100021311 |
11 | 39501561a08a3 |
12 | 14377248317bb |
13 | 69b350221413 |
14 | 2dc3c47a36d9 |
15 | 160152267eab |
hex | b044d061e3f |
12113100021311 has 4 divisors (see below), whose sum is σ = 12750631601400. Its totient is φ = 11475568441224.
The previous prime is 12113100021283. The next prime is 12113100021313. The reversal of 12113100021311 is 11312000131121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12113100021311 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 12113100021311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12113100021313) 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, 318765790016 + ... + 318765790053.
It is an arithmetic number, because the mean of its divisors is an integer number (3187657900350).
Almost surely, 212113100021311 is an apocalyptic number.
12113100021311 is a deficient number, since it is larger than the sum of its proper divisors (637531580089).
12113100021311 is an equidigital number, since it uses as much as digits as its factorization.
12113100021311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 637531580088.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 12113100021311 its reverse (11312000131121), we get a palindrome (23425100152432).
The spelling of 12113100021311 in words is "twelve trillion, one hundred thirteen billion, one hundred million, twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •