Base | Representation |
---|---|
bin | 110011100001100001011… |
… | …0010010011111000110101 |
3 | 221001222021010122011022121 |
4 | 1213003002302103320311 |
5 | 1412010123230303443 |
6 | 23021045514155541 |
7 | 1330420023316546 |
oct | 147030262237065 |
9 | 27058233564277 |
10 | 7081374072373 |
11 | 2290215064327 |
12 | 964501a22bb1 |
13 | 3c4a03331703 |
14 | 1a6a516944cd |
15 | c43096404ed |
hex | 670c2c93e35 |
7081374072373 has 2 divisors, whose sum is σ = 7081374072374. Its totient is φ = 7081374072372.
The previous prime is 7081374072319. The next prime is 7081374072397. The reversal of 7081374072373 is 3732704731807.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6448232399569 + 633141672804 = 2539337^2 + 795702^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-7081374072373 is a prime.
It is a super-2 number, since 2×70813740723732 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 7081374072373.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7081374072973) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3540687036186 + 3540687036187.
It is an arithmetic number, because the mean of its divisors is an integer number (3540687036187).
Almost surely, 27081374072373 is an apocalyptic number.
It is an amenable number.
7081374072373 is a deficient number, since it is larger than the sum of its proper divisors (1).
7081374072373 is an equidigital number, since it uses as much as digits as its factorization.
7081374072373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4148928, while the sum is 52.
The spelling of 7081374072373 in words is "seven trillion, eighty-one billion, three hundred seventy-four million, seventy-two thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •