Base | Representation |
---|---|
bin | 1010100001111100… |
… | …00101110001010111 |
3 | 112120222220112212021 |
4 | 11100332011301113 |
5 | 43034233434033 |
6 | 2332552234011 |
7 | 260045200246 |
oct | 52076056127 |
9 | 15528815767 |
10 | 5653421143 |
11 | 2441232a87 |
12 | 111939b907 |
13 | 6c133cb16 |
14 | 3b8b9295d |
15 | 2314c7b2d |
hex | 150f85c57 |
5653421143 has 2 divisors, whose sum is σ = 5653421144. Its totient is φ = 5653421142.
The previous prime is 5653421117. The next prime is 5653421159. The reversal of 5653421143 is 3411243565.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5653421143 - 225 = 5619866711 is a prime.
It is a super-2 number, since 2×56534211432 = 63922341240238852898, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5653421099 and 5653421108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5653424143) 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 as a sum of consecutive naturals, namely, 2826710571 + 2826710572.
It is an arithmetic number, because the mean of its divisors is an integer number (2826710572).
Almost surely, 25653421143 is an apocalyptic number.
5653421143 is a deficient number, since it is larger than the sum of its proper divisors (1).
5653421143 is an equidigital number, since it uses as much as digits as its factorization.
5653421143 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 43200, while the sum is 34.
The square root of 5653421143 is about 75189.2355527040. The cubic root of 5653421143 is about 1781.4369097424.
It can be divided in two parts, 56534 and 21143, that added together give a palindrome (77677).
The spelling of 5653421143 in words is "five billion, six hundred fifty-three million, four hundred twenty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •