Base | Representation |
---|---|
bin | 1100100011101100100100… |
… | …1011010011101101100001 |
3 | 1210212222022110011222111221 |
4 | 3020323021023103231201 |
5 | 3302210023404332311 |
6 | 45211010530135041 |
7 | 2623360150113415 |
oct | 310731113235541 |
9 | 53788273158457 |
10 | 13807400074081 |
11 | 444375a424699 |
12 | 166bb72421481 |
13 | 792055aa6c43 |
14 | 35a3d30cad45 |
15 | 18e26746d671 |
hex | c8ec92d3b61 |
13807400074081 has 2 divisors, whose sum is σ = 13807400074082. Its totient is φ = 13807400074080.
The previous prime is 13807400074063. The next prime is 13807400074157. The reversal of 13807400074081 is 18047000470831.
13807400074081 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., 12307754914081 + 1499645160000 = 3508241^2 + 1224600^2 .
It is a cyclic number.
It is not a de Polignac number, because 13807400074081 - 215 = 13807400041313 is a prime.
It is a super-2 number, since 2×138074000740812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13807400074031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6903700037040 + 6903700037041.
It is an arithmetic number, because the mean of its divisors is an integer number (6903700037041).
Almost surely, 213807400074081 is an apocalyptic number.
It is an amenable number.
13807400074081 is a deficient number, since it is larger than the sum of its proper divisors (1).
13807400074081 is an equidigital number, since it uses as much as digits as its factorization.
13807400074081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 150528, while the sum is 43.
The spelling of 13807400074081 in words is "thirteen trillion, eight hundred seven billion, four hundred million, seventy-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •