Base | Representation |
---|---|
bin | 1001011001000100… |
… | …01110010101111101 |
3 | 111000101200001220021 |
4 | 10230202032111331 |
5 | 40311241331240 |
6 | 2152154252141 |
7 | 235643311153 |
oct | 45442162575 |
9 | 14011601807 |
10 | 5042136445 |
11 | 2158177815 |
12 | b88727051 |
13 | 6247c29b8 |
14 | 35b90d3d3 |
15 | 1e79cb54a |
hex | 12c88e57d |
5042136445 has 8 divisors (see below), whose sum is σ = 6051381336. Its totient is φ = 4033164096.
The previous prime is 5042136433. The next prime is 5042136487. The reversal of 5042136445 is 5446312405.
It can be written as a sum of positive squares in 4 ways, for example, as 41100921 + 5001035524 = 6411^2 + 70718^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5042136445 - 27 = 5042136317 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5042136445.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 24942 + ... + 103471.
It is an arithmetic number, because the mean of its divisors is an integer number (756422667).
Almost surely, 25042136445 is an apocalyptic number.
It is an amenable number.
5042136445 is a deficient number, since it is larger than the sum of its proper divisors (1009244891).
5042136445 is a wasteful number, since it uses less digits than its factorization.
5042136445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136271.
The product of its (nonzero) digits is 57600, while the sum is 34.
The square root of 5042136445 is about 71008.0026827963. The cubic root of 5042136445 is about 1714.7660032017.
The spelling of 5042136445 in words is "five billion, forty-two million, one hundred thirty-six thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •