Base | Representation |
---|---|
bin | 1011111011010110111101… |
… | …1110110100000000100101 |
3 | 1201102201120110122020122211 |
4 | 2332311233132310000211 |
5 | 3204331300302044023 |
6 | 43520401423323421 |
7 | 2522325123340063 |
oct | 276655736640045 |
9 | 51381513566584 |
10 | 13114405503013 |
11 | 41a6874018491 |
12 | 15797aba50571 |
13 | 7418b5ac4029 |
14 | 334a52357033 |
15 | 17b208403a0d |
hex | bed6f7b4025 |
13114405503013 has 4 divisors (see below), whose sum is σ = 13176559083808. Its totient is φ = 13052251922220.
The previous prime is 13114405503011. The next prime is 13114405503019. The reversal of 13114405503013 is 31030550441131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13114405503013 - 21 = 13114405503011 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 (13114405503011) 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, 31076790081 + ... + 31076790502.
It is an arithmetic number, because the mean of its divisors is an integer number (3294139770952).
Almost surely, 213114405503013 is an apocalyptic number.
It is an amenable number.
13114405503013 is a deficient number, since it is larger than the sum of its proper divisors (62153580795).
13114405503013 is an equidigital number, since it uses as much as digits as its factorization.
13114405503013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62153580794.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 13114405503013 its reverse (31030550441131), we get a palindrome (44144955944144).
The spelling of 13114405503013 in words is "thirteen trillion, one hundred fourteen billion, four hundred five million, five hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •