Base | Representation |
---|---|
bin | 1001100001100001… |
… | …10000010000101100 |
3 | 111012100010001211201 |
4 | 10300300300100230 |
5 | 40432420214002 |
6 | 2203210255244 |
7 | 240464146465 |
oct | 46060602054 |
9 | 14170101751 |
10 | 5113054252 |
11 | 2194205379 |
12 | ba8427524 |
13 | 6363c31b7 |
14 | 3670cdd6c |
15 | 1edd39087 |
hex | 130c3042c |
5113054252 has 12 divisors (see below), whose sum is σ = 8952798456. Its totient is φ = 2555111840.
The previous prime is 5113054231. The next prime is 5113054259. The reversal of 5113054252 is 2524503115.
It is a super-2 number, since 2×51130542522 = 52286647567790559008, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5113054252.
It is not an unprimeable number, because it can be changed into a prime (5113054259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 345673 + ... + 360160.
It is an arithmetic number, because the mean of its divisors is an integer number (746066538).
Almost surely, 25113054252 is an apocalyptic number.
It is an amenable number.
5113054252 is a deficient number, since it is larger than the sum of its proper divisors (3839744204).
5113054252 is a wasteful number, since it uses less digits than its factorization.
5113054252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 707648 (or 707646 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 5113054252 is about 71505.6239186821. The cubic root of 5113054252 is about 1722.7680159685.
Adding to 5113054252 its reverse (2524503115), we get a palindrome (7637557367).
The spelling of 5113054252 in words is "five billion, one hundred thirteen million, fifty-four thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •