Base | Representation |
---|---|
bin | 1001110011011110111010… |
… | …0000110100100110001001 |
3 | 1102011120020221002002112201 |
4 | 2130313232200310212021 |
5 | 2403110043034331423 |
6 | 34532144201240201 |
7 | 2161556203412533 |
oct | 234675640644611 |
9 | 42146227062481 |
10 | 10780074527113 |
11 | 3486893042051 |
12 | 1261301193061 |
13 | 602730cc2548 |
14 | 293a8904c853 |
15 | 13a633cdb2ad |
hex | 9cdee834989 |
10780074527113 has 2 divisors, whose sum is σ = 10780074527114. Its totient is φ = 10780074527112.
The previous prime is 10780074526993. The next prime is 10780074527141. The reversal of 10780074527113 is 31172547008701.
10780074527113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9901865638729 + 878208888384 = 3146723^2 + 937128^2 .
It is a cyclic number.
It is not a de Polignac number, because 10780074527113 - 217 = 10780074396041 is a prime.
It is a super-2 number, since 2×107800745271132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10780074527413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5390037263556 + 5390037263557.
It is an arithmetic number, because the mean of its divisors is an integer number (5390037263557).
Almost surely, 210780074527113 is an apocalyptic number.
It is an amenable number.
10780074527113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10780074527113 is an equidigital number, since it uses as much as digits as its factorization.
10780074527113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 329280, while the sum is 46.
The spelling of 10780074527113 in words is "ten trillion, seven hundred eighty billion, seventy-four million, five hundred twenty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •