Base | Representation |
---|---|
bin | 100101010111000010000… |
… | …0110000101011100001001 |
3 | 200011212120012220010101001 |
4 | 1022232010012011130021 |
5 | 1133111332214401002 |
6 | 14530503302055001 |
7 | 1036653463526344 |
oct | 112560406053411 |
9 | 20155505803331 |
10 | 5134702106377 |
11 | 16aa684528818 |
12 | 6ab18141a461 |
13 | 2b327b18655c |
14 | 13a74152b45b |
15 | 8d873296a87 |
hex | 4ab84185709 |
5134702106377 has 8 divisors (see below), whose sum is σ = 5412466915200. Its totient is φ = 4857689030544.
The previous prime is 5134702106351. The next prime is 5134702106441. The reversal of 5134702106377 is 7736012074315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5134702106377 is a prime.
It is a super-2 number, since 2×51347021063772 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5134702106777) by changing a digit.
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, 187919218 + ... + 187946539.
It is an arithmetic number, because the mean of its divisors is an integer number (676558364400).
Almost surely, 25134702106377 is an apocalyptic number.
It is an amenable number.
5134702106377 is a deficient number, since it is larger than the sum of its proper divisors (277764808823).
5134702106377 is a wasteful number, since it uses less digits than its factorization.
5134702106377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375866495.
The product of its (nonzero) digits is 740880, while the sum is 46.
The spelling of 5134702106377 in words is "five trillion, one hundred thirty-four billion, seven hundred two million, one hundred six thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •