Base | Representation |
---|---|
bin | 1001011000000001… |
… | …00010011111100001 |
3 | 110222210001102220202 |
4 | 10230000202133201 |
5 | 40302011243311 |
6 | 2151241114545 |
7 | 235505252516 |
oct | 45400423741 |
9 | 13883042822 |
10 | 5033306081 |
11 | 21531963a1 |
12 | b85788a55 |
13 | 622a2062b |
14 | 35a69130d |
15 | 1e6d34e3b |
hex | 12c0227e1 |
5033306081 has 2 divisors, whose sum is σ = 5033306082. Its totient is φ = 5033306080.
The previous prime is 5033306077. The next prime is 5033306099. The reversal of 5033306081 is 1806033305.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2558741056 + 2474565025 = 50584^2 + 49745^2 .
It is a cyclic number.
It is not a de Polignac number, because 5033306081 - 22 = 5033306077 is a prime.
It is a super-2 number, since 2×50333060812 = 50668340210063157122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5033306011) 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, 2516653040 + 2516653041.
It is an arithmetic number, because the mean of its divisors is an integer number (2516653041).
Almost surely, 25033306081 is an apocalyptic number.
It is an amenable number.
5033306081 is a deficient number, since it is larger than the sum of its proper divisors (1).
5033306081 is an equidigital number, since it uses as much as digits as its factorization.
5033306081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 5033306081 is about 70945.7967817685. The cubic root of 5033306081 is about 1713.7643870397.
Adding to 5033306081 its reverse (1806033305), we get a palindrome (6839339386).
The spelling of 5033306081 in words is "five billion, thirty-three million, three hundred six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •