Base | Representation |
---|---|
bin | 1010010011010111… |
… | …00001000000000111 |
3 | 112021110202120110221 |
4 | 11021223201000013 |
5 | 42311431031211 |
6 | 2312502525211 |
7 | 254031446206 |
oct | 51153410007 |
9 | 15243676427 |
10 | 5531111431 |
11 | 238919397a |
12 | 10a4436807 |
13 | 6a1bb7801 |
14 | 3a683523d |
15 | 2258b7c71 |
hex | 149ae1007 |
5531111431 has 2 divisors, whose sum is σ = 5531111432. Its totient is φ = 5531111430.
The previous prime is 5531111407. The next prime is 5531111471. The reversal of 5531111431 is 1341111355.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5531111431 - 213 = 5531103239 is a prime.
It is a super-2 number, since 2×55311114312 = 61186387324277735522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5531111396 and 5531111405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5531111401) 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, 2765555715 + 2765555716.
It is an arithmetic number, because the mean of its divisors is an integer number (2765555716).
Almost surely, 25531111431 is an apocalyptic number.
5531111431 is a deficient number, since it is larger than the sum of its proper divisors (1).
5531111431 is an equidigital number, since it uses as much as digits as its factorization.
5531111431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 900, while the sum is 25.
The square root of 5531111431 is about 74371.4423081871. The cubic root of 5531111431 is about 1768.4962203938.
Adding to 5531111431 its reverse (1341111355), we get a palindrome (6872222786).
The spelling of 5531111431 in words is "five billion, five hundred thirty-one million, one hundred eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •