Base | Representation |
---|---|
bin | 1011111011001011000111… |
… | …0010100100111010011111 |
3 | 1201102102100200020000010012 |
4 | 2332302301302210322133 |
5 | 3204303241042404043 |
6 | 43515113535433435 |
7 | 2522153220535442 |
oct | 276626162447237 |
9 | 51372320200105 |
10 | 13111223013023 |
11 | 41a5490644673 |
12 | 157906208587b |
13 | 7414c9676465 |
14 | 33482d809659 |
15 | 17b0bdd13a18 |
hex | becb1ca4e9f |
13111223013023 has 4 divisors (see below), whose sum is σ = 13114625877768. Its totient is φ = 13107820148280.
The previous prime is 13111223013019. The next prime is 13111223013067. The reversal of 13111223013023 is 32031032211131.
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 13111223013023 - 22 = 13111223013019 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 13111223013023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111223013073) 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, 1701426593 + ... + 1701434298.
It is an arithmetic number, because the mean of its divisors is an integer number (3278656469442).
Almost surely, 213111223013023 is an apocalyptic number.
13111223013023 is a deficient number, since it is larger than the sum of its proper divisors (3402864745).
13111223013023 is an equidigital number, since it uses as much as digits as its factorization.
13111223013023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3402864744.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13111223013023 its reverse (32031032211131), we get a palindrome (45142255224154).
The spelling of 13111223013023 in words is "thirteen trillion, one hundred eleven billion, two hundred twenty-three million, thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •