Base | Representation |
---|---|
bin | 1001100101000000… |
… | …01001100110000010 |
3 | 111021101001200010000 |
4 | 10302200021212002 |
5 | 41012404143002 |
6 | 2210132220430 |
7 | 241300312002 |
oct | 46240114602 |
9 | 14241050100 |
10 | 5142256002 |
11 | 21a9740054 |
12 | bb616a716 |
13 | 63c478a40 |
14 | 36ad32002 |
15 | 2016a661c |
hex | 132809982 |
5142256002 has 40 divisors (see below), whose sum is σ = 12408810876. Its totient is φ = 1582231968.
The previous prime is 5142256001. The next prime is 5142256013. The reversal of 5142256002 is 2006522415.
5142256002 is a `hidden beast` number, since 51 + 4 + 2 + 2 + 5 + 600 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 5056489881 + 85766121 = 71109^2 + 9261^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (5142256001) 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 19 ways as a sum of consecutive naturals, for example, 1218753 + ... + 1222964.
Almost surely, 25142256002 is an apocalyptic number.
5142256002 is an abundant number, since it is smaller than the sum of its proper divisors (7266554874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5142256002 is a wasteful number, since it uses less digits than its factorization.
5142256002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2441744 (or 2441735 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 5142256002 is about 71709.5251832000. The cubic root of 5142256002 is about 1726.0414912863.
Adding to 5142256002 its reverse (2006522415), we get a palindrome (7148778417).
The spelling of 5142256002 in words is "five billion, one hundred forty-two million, two hundred fifty-six thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •