Base | Representation |
---|---|
bin | 1001100000110011… |
… | …11000111000011100 |
3 | 111011220211112121201 |
4 | 10300121320320130 |
5 | 40424401412002 |
6 | 2202434005244 |
7 | 240362203330 |
oct | 46031707034 |
9 | 14156745551 |
10 | 5107060252 |
11 | 2190890a58 |
12 | ba6416824 |
13 | 6350a4b58 |
14 | 3663ad7c0 |
15 | 1ed553087 |
hex | 130678e1c |
5107060252 has 12 divisors (see below), whose sum is σ = 10214120560. Its totient is φ = 2188740096.
The previous prime is 5107060229. The next prime is 5107060313. The reversal of 5107060252 is 2520607015.
5107060252 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 182395009 = 5107060252 / (5 + 1 + 0 + 7 + 0 + 6 + 0 + 2 + 5 + 2).
It is a self number, because there is not a number n which added to its sum of digits gives 5107060252.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91197477 + ... + 91197532.
Almost surely, 25107060252 is an apocalyptic number.
It is an amenable number.
5107060252 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5107060252 is a wasteful number, since it uses less digits than its factorization.
5107060252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182395020 (or 182395018 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 28.
The square root of 5107060252 is about 71463.6988407401. The cubic root of 5107060252 is about 1722.0945561831.
Adding to 5107060252 its reverse (2520607015), we get a palindrome (7627667267).
The spelling of 5107060252 in words is "five billion, one hundred seven million, sixty thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •