Base | Representation |
---|---|
bin | 1011111011001011000100… |
… | …1001110100110000100111 |
3 | 1201102102022221010020210112 |
4 | 2332302301021310300213 |
5 | 3204303230324030043 |
6 | 43515112514443235 |
7 | 2522153030662613 |
oct | 276626111646047 |
9 | 51372287106715 |
10 | 13111212330023 |
11 | 41a5485608345 |
12 | 157905a59351b |
13 | 7414c73a5a62 |
14 | 33482c228343 |
15 | 17b0bce03518 |
hex | becb1274c27 |
13111212330023 has 64 divisors (see below), whose sum is σ = 14974011786240. Its totient is φ = 11412952320000.
The previous prime is 13111212329899. The next prime is 13111212330049. The reversal of 13111212330023 is 32003321211131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13111212330023 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111212330323) 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 63 ways as a sum of consecutive naturals, for example, 1083475673 + ... + 1083487773.
It is an arithmetic number, because the mean of its divisors is an integer number (233968934160).
Almost surely, 213111212330023 is an apocalyptic number.
13111212330023 is a deficient number, since it is larger than the sum of its proper divisors (1862799456217).
13111212330023 is a wasteful number, since it uses less digits than its factorization.
13111212330023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12968.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13111212330023 its reverse (32003321211131), we get a palindrome (45114533541154).
The spelling of 13111212330023 in words is "thirteen trillion, one hundred eleven billion, two hundred twelve million, three hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •