Base | Representation |
---|---|
bin | 1010010000000001… |
… | …10100010111010011 |
3 | 112012112010112201022 |
4 | 11020000310113103 |
5 | 42232301010311 |
6 | 2310023230055 |
7 | 253241633552 |
oct | 51000642723 |
9 | 15175115638 |
10 | 5503141331 |
11 | 237441a596 |
12 | 1096ba832b |
13 | 69917375c |
14 | 3a2c33d99 |
15 | 2231e05db |
hex | 1480345d3 |
5503141331 has 2 divisors, whose sum is σ = 5503141332. Its totient is φ = 5503141330.
The previous prime is 5503141327. The next prime is 5503141351. The reversal of 5503141331 is 1331413055.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5503141331 - 22 = 5503141327 is a prime.
It is a super-2 number, since 2×55031413312 = 60569129017920903122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5503141331.
It is not a weakly prime, because it can be changed into another prime (5503141321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2751570665 + 2751570666.
It is an arithmetic number, because the mean of its divisors is an integer number (2751570666).
Almost surely, 25503141331 is an apocalyptic number.
5503141331 is a deficient number, since it is larger than the sum of its proper divisors (1).
5503141331 is an equidigital number, since it uses as much as digits as its factorization.
5503141331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 5503141331 is about 74183.1606970207. The cubic root of 5503141331 is about 1765.5101640867.
Adding to 5503141331 its reverse (1331413055), we get a palindrome (6834554386).
The spelling of 5503141331 in words is "five billion, five hundred three million, one hundred forty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •