Base | Representation |
---|---|
bin | 1011111100110110110000… |
… | …1100010110000110000111 |
3 | 1201112011221120020211220221 |
4 | 2333031230030112012013 |
5 | 3210241431223242043 |
6 | 43540253213205211 |
7 | 2524225266160561 |
oct | 277155414260607 |
9 | 51464846224827 |
10 | 13140120134023 |
11 | 420676a287353 |
12 | 1582787790807 |
13 | 7441533c031c |
14 | 335db15a6331 |
15 | 17bc10bd88ed |
hex | bf36c316187 |
13140120134023 has 4 divisors (see below), whose sum is σ = 13563994977088. Its totient is φ = 12716245290960.
The previous prime is 13140120134017. The next prime is 13140120134033. The reversal of 13140120134023 is 32043102104131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13140120134023 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 (13140120134033) 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 3 ways as a sum of consecutive naturals, for example, 211937421486 + ... + 211937421547.
It is an arithmetic number, because the mean of its divisors is an integer number (3390998744272).
Almost surely, 213140120134023 is an apocalyptic number.
13140120134023 is a deficient number, since it is larger than the sum of its proper divisors (423874843065).
13140120134023 is an equidigital number, since it uses as much as digits as its factorization.
13140120134023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423874843064.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 13140120134023 its reverse (32043102104131), we get a palindrome (45183222238154).
The spelling of 13140120134023 in words is "thirteen trillion, one hundred forty billion, one hundred twenty million, one hundred thirty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •