Base | Representation |
---|---|
bin | 101101010111011010011… |
… | …100010111000010010001 |
3 | 102001000212001122121000002 |
4 | 231113122130113002101 |
5 | 402034133114011243 |
6 | 10344100034335345 |
7 | 441142646052653 |
oct | 55273234270221 |
9 | 12030761577002 |
10 | 3117516157073 |
11 | aa214966294a |
12 | 424241a2a555 |
13 | 197c99254016 |
14 | aac623d66d3 |
15 | 56161610eb8 |
hex | 2d5da717091 |
3117516157073 has 2 divisors, whose sum is σ = 3117516157074. Its totient is φ = 3117516157072.
The previous prime is 3117516157057. The next prime is 3117516157139. The reversal of 3117516157073 is 3707516157113.
3117516157073 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2641460316049 + 476055841024 = 1625257^2 + 689968^2 .
It is a cyclic number.
It is not a de Polignac number, because 3117516157073 - 24 = 3117516157057 is a prime.
It is a super-2 number, since 2×31175161570732 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3117516157673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1558758078536 + 1558758078537.
It is an arithmetic number, because the mean of its divisors is an integer number (1558758078537).
Almost surely, 23117516157073 is an apocalyptic number.
It is an amenable number.
3117516157073 is a deficient number, since it is larger than the sum of its proper divisors (1).
3117516157073 is an equidigital number, since it uses as much as digits as its factorization.
3117516157073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 463050, while the sum is 47.
The spelling of 3117516157073 in words is "three trillion, one hundred seventeen billion, five hundred sixteen million, one hundred fifty-seven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •