Base | Representation |
---|---|
bin | 111010101110010101110… |
… | …0001010000000100111001 |
3 | 1001120120121000220012221001 |
4 | 1311130223201100010321 |
5 | 2024213323230423243 |
6 | 25055430520245001 |
7 | 1462052152252624 |
oct | 165345341200471 |
9 | 31516530805831 |
10 | 8070973686073 |
11 | 2631976266041 |
12 | aa4260910761 |
13 | 4671219946cc |
14 | 1dc8cc712dbb |
15 | dee27caaa4d |
hex | 7572b850139 |
8070973686073 has 2 divisors, whose sum is σ = 8070973686074. Its totient is φ = 8070973686072.
The previous prime is 8070973686059. The next prime is 8070973686107. The reversal of 8070973686073 is 3706863790708.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7737810382864 + 333163303209 = 2781692^2 + 577203^2 .
It is a cyclic number.
It is not a de Polignac number, because 8070973686073 - 213 = 8070973677881 is a prime.
It is a super-2 number, since 2×80709736860732 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 8070973685996 and 8070973686014.
It is not a weakly prime, because it can be changed into another prime (8070973686173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4035486843036 + 4035486843037.
It is an arithmetic number, because the mean of its divisors is an integer number (4035486843037).
Almost surely, 28070973686073 is an apocalyptic number.
It is an amenable number.
8070973686073 is a deficient number, since it is larger than the sum of its proper divisors (1).
8070973686073 is an equidigital number, since it uses as much as digits as its factorization.
8070973686073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64012032, while the sum is 64.
The spelling of 8070973686073 in words is "eight trillion, seventy billion, nine hundred seventy-three million, six hundred eighty-six thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •