Base | Representation |
---|---|
bin | 1011111011001011000110… |
… | …0111111101111101010111 |
3 | 1201102102100110222201022012 |
4 | 2332302301213331331113 |
5 | 3204303234334411043 |
6 | 43515113400054435 |
7 | 2522153155103534 |
oct | 276626147757527 |
9 | 51372313881265 |
10 | 13111220232023 |
11 | 41a548a015221 |
12 | 157906116441b |
13 | 7414c8c116b4 |
14 | 33482d2c3d8b |
15 | 17b0bd964a18 |
hex | becb19fdf57 |
13111220232023 has 8 divisors (see below), whose sum is σ = 13231587890400. Its totient is φ = 12990854050848.
The previous prime is 13111220232001. The next prime is 13111220232037. The reversal of 13111220232023 is 32023202211131.
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 13111220232023 - 26 = 13111220231959 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 13111220232023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111220232043) 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, 26188118 + ... + 26684076.
It is an arithmetic number, because the mean of its divisors is an integer number (1653948486300).
Almost surely, 213111220232023 is an apocalyptic number.
13111220232023 is a deficient number, since it is larger than the sum of its proper divisors (120367658377).
13111220232023 is a wasteful number, since it uses less digits than its factorization.
13111220232023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 738601.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13111220232023 its reverse (32023202211131), we get a palindrome (45134422443154).
The spelling of 13111220232023 in words is "thirteen trillion, one hundred eleven billion, two hundred twenty million, two hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •