Base | Representation |
---|---|
bin | 110000110011011000000… |
… | …1101111101110011000111 |
3 | 212202012222021012020001200 |
4 | 1201212300031331303013 |
5 | 1334343224000300241 |
6 | 22133200500353543 |
7 | 1261410430463130 |
oct | 141466015756307 |
9 | 25665867166050 |
10 | 6707400400071 |
11 | 2156657734168 |
12 | 903b329a58b3 |
13 | 398674a54397 |
14 | 1928d5cbac87 |
15 | b971ca9b4b6 |
hex | 619b037dcc7 |
6707400400071 has 96 divisors (see below), whose sum is σ = 11561857781760. Its totient is φ = 3666304857600.
The previous prime is 6707400400067. The next prime is 6707400400093. The reversal of 6707400400071 is 1700040047076.
It is not a de Polignac number, because 6707400400071 - 22 = 6707400400067 is a prime.
It is a super-2 number, since 2×67074004000712 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6707400399999 and 6707400400035.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6707400404071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1078183741 + ... + 1078189961.
It is an arithmetic number, because the mean of its divisors is an integer number (120436018560).
Almost surely, 26707400400071 is an apocalyptic number.
6707400400071 is a deficient number, since it is larger than the sum of its proper divisors (4854457381689).
6707400400071 is a wasteful number, since it uses less digits than its factorization.
6707400400071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12557 (or 12554 counting only the distinct ones).
The product of its (nonzero) digits is 32928, while the sum is 36.
The spelling of 6707400400071 in words is "six trillion, seven hundred seven billion, four hundred million, four hundred thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •