Base | Representation |
---|---|
bin | 1001100011111101… |
… | …10101010111111111 |
3 | 111020202121221220102 |
4 | 10301332311113333 |
5 | 41003140204211 |
6 | 2205221111315 |
7 | 241133135462 |
oct | 46176652777 |
9 | 14222557812 |
10 | 5133522431 |
11 | 21a4815424 |
12 | bb325853b |
13 | 63a70b74b |
14 | 369adb2d9 |
15 | 200a2da3b |
hex | 131fb55ff |
5133522431 has 2 divisors, whose sum is σ = 5133522432. Its totient is φ = 5133522430.
The previous prime is 5133522371. The next prime is 5133522461. The reversal of 5133522431 is 1342253315.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5133522431 - 218 = 5133260287 is a prime.
It is a super-2 number, since 2×51335224312 = 52706105099160299522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5133522394 and 5133522403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5133522461) 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 as a sum of consecutive naturals, namely, 2566761215 + 2566761216.
It is an arithmetic number, because the mean of its divisors is an integer number (2566761216).
Almost surely, 25133522431 is an apocalyptic number.
5133522431 is a deficient number, since it is larger than the sum of its proper divisors (1).
5133522431 is an equidigital number, since it uses as much as digits as its factorization.
5133522431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10800, while the sum is 29.
The square root of 5133522431 is about 71648.6038314774. The cubic root of 5133522431 is about 1725.0637720315.
Adding to 5133522431 its reverse (1342253315), we get a palindrome (6475775746).
The spelling of 5133522431 in words is "five billion, one hundred thirty-three million, five hundred twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •