Base | Representation |
---|---|
bin | 11000011101010110… |
… | …11000100000101111 |
3 | 1020220010120210222201 |
4 | 30032223120200233 |
5 | 203343033434003 |
6 | 10010554122331 |
7 | 643254660124 |
oct | 141653304057 |
9 | 36803523881 |
10 | 13131155503 |
11 | 5629216534 |
12 | 26657203a7 |
13 | 13136033cb |
14 | 8c7d4a74b |
15 | 51cc0cb1d |
hex | 30ead882f |
13131155503 has 8 divisors (see below), whose sum is σ = 13399626528. Its totient is φ = 12863451744.
The previous prime is 13131155483. The next prime is 13131155507. The reversal of 13131155503 is 30555113131.
13131155503 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13131155503 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 (13131155507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 157176 + ... + 225757.
It is an arithmetic number, because the mean of its divisors is an integer number (1674953316).
Almost surely, 213131155503 is an apocalyptic number.
13131155503 is a deficient number, since it is larger than the sum of its proper divisors (268471025).
13131155503 is an equidigital number, since it uses as much as digits as its factorization.
13131155503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383633.
The product of its (nonzero) digits is 3375, while the sum is 28.
Adding to 13131155503 its reverse (30555113131), we get a palindrome (43686268634).
The spelling of 13131155503 in words is "thirteen billion, one hundred thirty-one million, one hundred fifty-five thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •