Base | Representation |
---|---|
bin | 1001011011011100… |
… | …01001000110001111 |
3 | 111001210010011120022 |
4 | 10231232021012033 |
5 | 40331340203103 |
6 | 2154145012355 |
7 | 236304416666 |
oct | 45556110617 |
9 | 14053104508 |
10 | 5062037903 |
11 | 216842aaaa |
12 | b933240bb |
13 | 628970300 |
14 | 36040dddd |
15 | 1e960d138 |
hex | 12db8918f |
5062037903 has 12 divisors (see below), whose sum is σ = 5494475448. Its totient is φ = 4661485920.
The previous prime is 5062037881. The next prime is 5062037923. The reversal of 5062037903 is 3097302605.
It is a Cunningham number, because it is equal to 711482-1.
It is not a de Polignac number, because 5062037903 - 212 = 5062033807 is a prime.
It is a Smith number, since the sum of its digits (35) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5062037923) 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 in 11 ways as a sum of consecutive naturals, for example, 35576 + ... + 106722.
It is an arithmetic number, because the mean of its divisors is an integer number (457872954).
Almost surely, 25062037903 is an apocalyptic number.
5062037903 is a deficient number, since it is larger than the sum of its proper divisors (432437545).
5062037903 is a wasteful number, since it uses less digits than its factorization.
5062037903 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71594 (or 71581 counting only the distinct ones).
The product of its (nonzero) digits is 34020, while the sum is 35.
The square root of 5062037903 is about 71147.9999929724. Note that the first 5 decimals coincide. The cubic root of 5062037903 is about 1717.0191183868.
The spelling of 5062037903 in words is "five billion, sixty-two million, thirty-seven thousand, nine hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •