Base | Representation |
---|---|
bin | 1001100010011111… |
… | …11110001011000100 |
3 | 111012220111211102101 |
4 | 10301033332023010 |
5 | 40442014101300 |
6 | 2204101521444 |
7 | 240623542105 |
oct | 46117761304 |
9 | 14186454371 |
10 | 5121237700 |
11 | 2198894757 |
12 | bab113284 |
13 | 637cc9c87 |
14 | 3682203ac |
15 | 1ee903b6a |
hex | 1313fe2c4 |
5121237700 has 18 divisors (see below), whose sum is σ = 11113086026. Its totient is φ = 2048495040.
The previous prime is 5121237683. The next prime is 5121237703. The reversal of 5121237700 is 77321215.
It can be written as a sum of positive squares in 3 ways, for example, as 362445444 + 4758792256 = 19038^2 + 68984^2 .
It is not an unprimeable number, because it can be changed into a prime (5121237703) 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 5 ways as a sum of consecutive naturals, for example, 25606089 + ... + 25606288.
Almost surely, 25121237700 is an apocalyptic number.
5121237700 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5121237700 is an abundant number, since it is smaller than the sum of its proper divisors (5991848326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5121237700 is a wasteful number, since it uses less digits than its factorization.
5121237700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51212391 (or 51212384 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 28.
The square root of 5121237700 is about 71562.8234490507. The cubic root of 5121237700 is about 1723.6866233263.
Adding to 5121237700 its reverse (77321215), we get a palindrome (5198558915).
The spelling of 5121237700 in words is "five billion, one hundred twenty-one million, two hundred thirty-seven thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •