Base | Representation |
---|---|
bin | 1001010101011111… |
… | …01011000100100101 |
3 | 110221022011110000020 |
4 | 10222233223010211 |
5 | 40231044420212 |
6 | 2145202505353 |
7 | 235130132322 |
oct | 45257530445 |
9 | 13838143006 |
10 | 5012107557 |
11 | 2142227656 |
12 | b7a665259 |
13 | 61b50a822 |
14 | 357933b49 |
15 | 1e5048d8c |
hex | 12abeb125 |
5012107557 has 4 divisors (see below), whose sum is σ = 6682810080. Its totient is φ = 3341405036.
The previous prime is 5012107547. The next prime is 5012107571. The reversal of 5012107557 is 7557012105.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5012107557 - 211 = 5012105509 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5012107547) 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 3 ways as a sum of consecutive naturals, for example, 835351257 + ... + 835351262.
It is an arithmetic number, because the mean of its divisors is an integer number (1670702520).
Almost surely, 25012107557 is an apocalyptic number.
It is an amenable number.
5012107557 is a deficient number, since it is larger than the sum of its proper divisors (1670702523).
5012107557 is a wasteful number, since it uses less digits than its factorization.
5012107557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1670702522.
The product of its (nonzero) digits is 12250, while the sum is 33.
The square root of 5012107557 is about 70796.2397094648. The cubic root of 5012107557 is about 1711.3550761653.
The spelling of 5012107557 in words is "five billion, twelve million, one hundred seven thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •