Base | Representation |
---|---|
bin | 1011111011010110111101… |
… | …0101010110000100110111 |
3 | 1201102201120021222011010112 |
4 | 2332311233111112010313 |
5 | 3204331244133133421 |
6 | 43520401254213235 |
7 | 2522325063262160 |
oct | 276655725260467 |
9 | 51381507864115 |
10 | 13114403021111 |
11 | 41a6872682827 |
12 | 15797ab05421b |
13 | 7418b5435452 |
14 | 334a51cac767 |
15 | 17b2080b345b |
hex | bed6f556137 |
13114403021111 has 8 divisors (see below), whose sum is σ = 15306780426240. Its totient is φ = 11001748430808.
The previous prime is 13114403021101. The next prime is 13114403021119. The reversal of 13114403021111 is 11112030441131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13114403021111 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 (13114403021119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19930703351 + ... + 19930704008.
It is an arithmetic number, because the mean of its divisors is an integer number (1913347553280).
Almost surely, 213114403021111 is an apocalyptic number.
13114403021111 is a deficient number, since it is larger than the sum of its proper divisors (2192377405129).
13114403021111 is an equidigital number, since it uses as much as digits as its factorization.
13114403021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39861407413.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 13114403021111 its reverse (11112030441131), we get a palindrome (24226433462242).
The spelling of 13114403021111 in words is "thirteen trillion, one hundred fourteen billion, four hundred three million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •