Base | Representation |
---|---|
bin | 1001100101000001… |
… | …01110011010000100 |
3 | 111021101100022221200 |
4 | 10302200232122010 |
5 | 41012424004123 |
6 | 2210135342500 |
7 | 241301510421 |
oct | 46240563204 |
9 | 14241308850 |
10 | 5142406788 |
11 | 21a9833372 |
12 | bb6221a30 |
13 | 63c4cc56c |
14 | 36ad70d48 |
15 | 2016d6143 |
hex | 13282e684 |
5142406788 has 36 divisors (see below), whose sum is σ = 13447100940. Its totient is φ = 1655027136.
The previous prime is 5142406781. The next prime is 5142406799. The reversal of 5142406788 is 8876042415.
It can be written as a sum of positive squares in 2 ways, for example, as 3754993284 + 1387413504 = 61278^2 + 37248^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is not an unprimeable number, because it can be changed into a prime (5142406781) 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 11 ways as a sum of consecutive naturals, for example, 2461795 + ... + 2463882.
Almost surely, 25142406788 is an apocalyptic number.
5142406788 is a gapful number since it is divisible by the number (58) formed by its first and last digit.
It is an amenable number.
5142406788 is an abundant number, since it is smaller than the sum of its proper divisors (8304694152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5142406788 is a wasteful number, since it uses less digits than its factorization.
5142406788 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4925716 (or 4925711 counting only the distinct ones).
The product of its (nonzero) digits is 430080, while the sum is 45.
The square root of 5142406788 is about 71710.5765420973. The cubic root of 5142406788 is about 1726.0583619846.
The spelling of 5142406788 in words is "five billion, one hundred forty-two million, four hundred six thousand, seven hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •