Base | Representation |
---|---|
bin | 10000110101110001000100… |
… | …111100010010010001100001 |
3 | 100201020102000201120120022021 |
4 | 100311301010330102101201 |
5 | 34201424144103101101 |
6 | 421304200253141441 |
7 | 21412626242521405 |
oct | 2065610474222141 |
9 | 321212021516267 |
10 | 74063572706401 |
11 | 21665203a60a73 |
12 | 838202478a881 |
13 | 324321b4a4575 |
14 | 14409a5d41105 |
15 | 88686bbc35a1 |
hex | 435c44f12461 |
74063572706401 has 2 divisors, whose sum is σ = 74063572706402. Its totient is φ = 74063572706400.
The previous prime is 74063572706317. The next prime is 74063572706443. The reversal of 74063572706401 is 10460727536047.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46206278150400 + 27857294556001 = 6797520^2 + 5278001^2 .
It is an emirp because it is prime and its reverse (10460727536047) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 74063572706401 - 223 = 74063564317793 is a prime.
It is not a weakly prime, because it can be changed into another prime (74063572700401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 37031786353200 + 37031786353201.
It is an arithmetic number, because the mean of its divisors is an integer number (37031786353201).
Almost surely, 274063572706401 is an apocalyptic number.
It is an amenable number.
74063572706401 is a deficient number, since it is larger than the sum of its proper divisors (1).
74063572706401 is an equidigital number, since it uses as much as digits as its factorization.
74063572706401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5927040, while the sum is 52.
The spelling of 74063572706401 in words is "seventy-four trillion, sixty-three billion, five hundred seventy-two million, seven hundred six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •