Base | Representation |
---|---|
bin | 1011111101000011011101… |
… | …1011111101100001000111 |
3 | 1201112111202012112010010010 |
4 | 2333100313123331201013 |
5 | 3210320422140040003 |
6 | 43542015422401303 |
7 | 2524405632446235 |
oct | 277206733754107 |
9 | 51474665463103 |
10 | 13143530002503 |
11 | 420815a042a7a |
12 | 1583379730233 |
13 | 74457798cb94 |
14 | 3362163c1955 |
15 | 17bd60240003 |
hex | bf4376fd847 |
13143530002503 has 4 divisors (see below), whose sum is σ = 17524706670008. Its totient is φ = 8762353335000.
The previous prime is 13143530002457. The next prime is 13143530002507. The reversal of 13143530002503 is 30520003534131.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 13143530002503 - 221 = 13143527905351 is a prime.
It is a super-2 number, since 2×131435300025032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13143530002507) 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, 2190588333748 + ... + 2190588333753.
It is an arithmetic number, because the mean of its divisors is an integer number (4381176667502).
Almost surely, 213143530002503 is an apocalyptic number.
13143530002503 is a deficient number, since it is larger than the sum of its proper divisors (4381176667505).
13143530002503 is an equidigital number, since it uses as much as digits as its factorization.
13143530002503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4381176667504.
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 13143530002503 its reverse (30520003534131), we get a palindrome (43663533536634).
The spelling of 13143530002503 in words is "thirteen trillion, one hundred forty-three billion, five hundred thirty million, two thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •