Base | Representation |
---|---|
bin | 1001011010010000… |
… | …00001100000010011 |
3 | 111001002022111100001 |
4 | 10231020001200103 |
5 | 40321310422311 |
6 | 2153150510431 |
7 | 236123451064 |
oct | 45510014023 |
9 | 14032274301 |
10 | 5052045331 |
11 | 2162825483 |
12 | b8bb05417 |
13 | 626881c48 |
14 | 35cd6c56b |
15 | 1e87d74c1 |
hex | 12d201813 |
5052045331 has 2 divisors, whose sum is σ = 5052045332. Its totient is φ = 5052045330.
The previous prime is 5052045283. The next prime is 5052045347. The reversal of 5052045331 is 1335402505.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5052045331 - 231 = 2904561683 is a prime.
It is a super-2 number, since 2×50520453312 = 51046324052957799122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5052045331.
It is not a weakly prime, because it can be changed into another prime (5052045391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2526022665 + 2526022666.
It is an arithmetic number, because the mean of its divisors is an integer number (2526022666).
Almost surely, 25052045331 is an apocalyptic number.
5052045331 is a deficient number, since it is larger than the sum of its proper divisors (1).
5052045331 is an equidigital number, since it uses as much as digits as its factorization.
5052045331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 28.
The square root of 5052045331 is about 71077.7414596159. The cubic root of 5052045331 is about 1715.8885632224. Note that the first 3 decimals are identical.
Adding to 5052045331 its reverse (1335402505), we get a palindrome (6387447836).
The spelling of 5052045331 in words is "five billion, fifty-two million, forty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •