Base | Representation |
---|---|
bin | 100100111000111011010… |
… | …0100110110100101110001 |
3 | 122221200200120000112111001 |
4 | 1021301312210312211301 |
5 | 1131031431000002203 |
6 | 14441052115522001 |
7 | 1032204404403022 |
oct | 111616644664561 |
9 | 18850616015431 |
10 | 5070050781553 |
11 | 168521854355a |
12 | 69a7398b9301 |
13 | 2aa146bab974 |
14 | 13756b01ac49 |
15 | 8bd3c51391d |
hex | 49c76936971 |
5070050781553 has 8 divisors (see below), whose sum is σ = 5172081719616. Its totient is φ = 4968255754800.
The previous prime is 5070050781473. The next prime is 5070050781571. The reversal of 5070050781553 is 3551870500705.
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 5070050781553 - 217 = 5070050650481 is a prime.
It is a super-2 number, since 2×50700507815532 (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 (5070050781053) 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, 58934413 + ... + 59020378.
It is an arithmetic number, because the mean of its divisors is an integer number (646510214952).
Almost surely, 25070050781553 is an apocalyptic number.
5070050781553 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
5070050781553 is a deficient number, since it is larger than the sum of its proper divisors (102030938063).
5070050781553 is a wasteful number, since it uses less digits than its factorization.
5070050781553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117955655.
The product of its (nonzero) digits is 735000, while the sum is 46.
The spelling of 5070050781553 in words is "five trillion, seventy billion, fifty million, seven hundred eighty-one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •