Base | Representation |
---|---|
bin | 1001100101100110… |
… | …01101011011100010 |
3 | 111021201110111221122 |
4 | 10302303031123202 |
5 | 41020144034300 |
6 | 2210431252242 |
7 | 241360631624 |
oct | 46263153342 |
9 | 14251414848 |
10 | 5147252450 |
11 | 2201542a4a |
12 | bb797a082 |
13 | 640508012 |
14 | 36b872c14 |
15 | 201d41c85 |
hex | 132ccd6e2 |
5147252450 has 12 divisors (see below), whose sum is σ = 9573889650. Its totient is φ = 2058900960.
The previous prime is 5147252449. The next prime is 5147252459. The reversal of 5147252450 is 542527415.
It can be written as a sum of positive squares in 3 ways, for example, as 4816776409 + 330476041 = 69403^2 + 18179^2 .
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5147252450.
It is not an unprimeable number, because it can be changed into a prime (5147252459) 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, 51472475 + ... + 51472574.
Almost surely, 25147252450 is an apocalyptic number.
5147252450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5147252450 is a deficient number, since it is larger than the sum of its proper divisors (4426637200).
5147252450 is a wasteful number, since it uses less digits than its factorization.
5147252450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102945061 (or 102945056 counting only the distinct ones).
The product of its (nonzero) digits is 56000, while the sum is 35.
The square root of 5147252450 is about 71744.3548301886. The cubic root of 5147252450 is about 1726.6003435929.
Adding to 5147252450 its reverse (542527415), we get a palindrome (5689779865).
The spelling of 5147252450 in words is "five billion, one hundred forty-seven million, two hundred fifty-two thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •