Base | Representation |
---|---|
bin | 101001100001110000000… |
… | …0000010011111011000011 |
3 | 202012121222201200000111101 |
4 | 1103003200000103323003 |
5 | 1222002402013401300 |
6 | 20045551103355231 |
7 | 1126231354614163 |
oct | 123034000237303 |
9 | 22177881600441 |
10 | 5707474747075 |
11 | 1900587779282 |
12 | 7821918b2b17 |
13 | 32529bcb9b6a |
14 | 15a3596a85a3 |
15 | 9d6e7b1db6a |
hex | 530e0013ec3 |
5707474747075 has 24 divisors (see below), whose sum is σ = 7236834299568. Its totient is φ = 4463656279680.
The previous prime is 5707474747069. The next prime is 5707474747133.
It is a happy number.
5707474747075 is nontrivially palindromic in base 10.
5707474747075 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-5707474747075 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5707474746998 and 5707474747016.
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 23 ways as a sum of consecutive naturals, for example, 7408297 + ... + 8142346.
It is an arithmetic number, because the mean of its divisors is an integer number (301534762482).
Almost surely, 25707474747075 is an apocalyptic number.
5707474747075 is a deficient number, since it is larger than the sum of its proper divisors (1529359552493).
5707474747075 is a wasteful number, since it uses less digits than its factorization.
5707474747075 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15550983 (or 15550978 counting only the distinct ones).
The product of its (nonzero) digits is 188238400, while the sum is 64.
The spelling of 5707474747075 in words is "five trillion, seven hundred seven billion, four hundred seventy-four million, seven hundred forty-seven thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •