Base | Representation |
---|---|
bin | 1001011010010000… |
… | …00101000111001111 |
3 | 111001002100020121110 |
4 | 10231020011013033 |
5 | 40321311410421 |
6 | 2153151103103 |
7 | 236123542140 |
oct | 45510050717 |
9 | 14032306543 |
10 | 5052060111 |
11 | 216283559a |
12 | b8bb11a93 |
13 | 6268888a7 |
14 | 35cd73ac7 |
15 | 1e87dba76 |
hex | 12d2051cf |
5052060111 has 32 divisors (see below), whose sum is σ = 7961214976. Its totient is φ = 2788668000.
The previous prime is 5052060107. The next prime is 5052060121. The reversal of 5052060111 is 1110602505.
It is not a de Polignac number, because 5052060111 - 22 = 5052060107 is a prime.
It is a super-5 number, since 5×50520601115 (a number of 50 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5052060121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 364926 + ... + 378516.
It is an arithmetic number, because the mean of its divisors is an integer number (248787968).
Almost surely, 25052060111 is an apocalyptic number.
5052060111 is a deficient number, since it is larger than the sum of its proper divisors (2909154865).
5052060111 is a wasteful number, since it uses less digits than its factorization.
5052060111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14203.
The product of its (nonzero) digits is 300, while the sum is 21.
The square root of 5052060111 is about 71077.8454302042. The cubic root of 5052060111 is about 1715.8902365254.
Adding to 5052060111 its reverse (1110602505), we get a palindrome (6162662616).
The spelling of 5052060111 in words is "five billion, fifty-two million, sixty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •