Base | Representation |
---|---|
bin | 100100101100001100001… |
… | …0110100100100100001111 |
3 | 122212002002110000210112112 |
4 | 1021120120112210210033 |
5 | 1130104422221110011 |
6 | 14420330125254235 |
7 | 1030215545160116 |
oct | 111303026444417 |
9 | 18762073023475 |
10 | 5042700175631 |
11 | 1674662871508 |
12 | 69538610437b |
13 | 2a76a8692191 |
14 | 1360d47d0c7d |
15 | 8b28b2c558b |
hex | 496185a490f |
5042700175631 has 8 divisors (see below), whose sum is σ = 5205934080000. Its totient is φ = 4879501656120.
The previous prime is 5042700175607. The next prime is 5042700175633. The reversal of 5042700175631 is 1365710072405.
5042700175631 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 5042700175631 - 214 = 5042700159247 is a prime.
It is a super-2 number, since 2×50427001756312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5042700175633) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8556431 + ... + 9126768.
It is an arithmetic number, because the mean of its divisors is an integer number (650741760000).
Almost surely, 25042700175631 is an apocalyptic number.
5042700175631 is a deficient number, since it is larger than the sum of its proper divisors (163233904369).
5042700175631 is a wasteful number, since it uses less digits than its factorization.
5042700175631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17692429.
The product of its (nonzero) digits is 176400, while the sum is 41.
The spelling of 5042700175631 in words is "five trillion, forty-two billion, seven hundred million, one hundred seventy-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •