Base | Representation |
---|---|
bin | 1001111100110101… |
… | …01101000100011001 |
3 | 111210022012121000211 |
4 | 10332122231010121 |
5 | 41420042430113 |
6 | 2242032531121 |
7 | 246245366005 |
oct | 47632550431 |
9 | 14708177024 |
10 | 5342155033 |
11 | 22a1564166 |
12 | 10510b0aa1 |
13 | 6719c90a7 |
14 | 3896c9705 |
15 | 213ee0b3d |
hex | 13e6ad119 |
5342155033 has 2 divisors, whose sum is σ = 5342155034. Its totient is φ = 5342155032.
The previous prime is 5342155001. The next prime is 5342155079. The reversal of 5342155033 is 3305512435.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4239051664 + 1103103369 = 65108^2 + 33213^2 .
It is a cyclic number.
It is not a de Polignac number, because 5342155033 - 25 = 5342155001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5342154986 and 5342155004.
It is not a weakly prime, because it can be changed into another prime (5342155733) 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, 2671077516 + 2671077517.
It is an arithmetic number, because the mean of its divisors is an integer number (2671077517).
Almost surely, 25342155033 is an apocalyptic number.
It is an amenable number.
5342155033 is a deficient number, since it is larger than the sum of its proper divisors (1).
5342155033 is an equidigital number, since it uses as much as digits as its factorization.
5342155033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 31.
The square root of 5342155033 is about 73090.0474278133. The cubic root of 5342155033 is about 1748.1237068960.
Adding to 5342155033 its reverse (3305512435), we get a palindrome (8647667468).
The spelling of 5342155033 in words is "five billion, three hundred forty-two million, one hundred fifty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •