Base | Representation |
---|---|
bin | 1001100110000011… |
… | …00011100110000010 |
3 | 111021222112120210112 |
4 | 10303001203212002 |
5 | 41022124411000 |
6 | 2211044031322 |
7 | 241434614225 |
oct | 46301434602 |
9 | 14258476715 |
10 | 5151013250 |
11 | 2203681549 |
12 | bb9092542 |
13 | 641223a46 |
14 | 36c1715bc |
15 | 202336235 |
hex | 133063982 |
5151013250 has 32 divisors (see below), whose sum is σ = 9675744624. Its totient is φ = 2053344000.
The previous prime is 5151013247. The next prime is 5151013253. The reversal of 5151013250 is 523101515.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (5151013247) and next prime (5151013253).
It can be written as a sum of positive squares in 8 ways, for example, as 2412479689 + 2738533561 = 49117^2 + 52331^2 .
It is not an unprimeable number, because it can be changed into a prime (5151013253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38090 + ... + 108410.
Almost surely, 25151013250 is an apocalyptic number.
5151013250 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5151013250 is a deficient number, since it is larger than the sum of its proper divisors (4524731374).
5151013250 is a wasteful number, since it uses less digits than its factorization.
5151013250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70631 (or 70621 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 23.
The square root of 5151013250 is about 71770.5597720960. The cubic root of 5151013250 is about 1727.0207502614.
Adding to 5151013250 its reverse (523101515), we get a palindrome (5674114765).
The spelling of 5151013250 in words is "five billion, one hundred fifty-one million, thirteen thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •