Base | Representation |
---|---|
bin | 1001001110001110101001… |
… | …1100111001101010000101 |
3 | 1022220101020221210121022112 |
4 | 2103203222130321222011 |
5 | 2312113313400411201 |
6 | 33322135540510405 |
7 | 2064411022055456 |
oct | 223435234715205 |
9 | 38811227717275 |
10 | 10140056263301 |
11 | 325a412456658 |
12 | 11792643ab405 |
13 | 5872845896c3 |
14 | 270ad200512d |
15 | 128b75a7a0bb |
hex | 938ea739a85 |
10140056263301 has 2 divisors, whose sum is σ = 10140056263302. Its totient is φ = 10140056263300.
The previous prime is 10140056263237. The next prime is 10140056263357. The reversal of 10140056263301 is 10336265004101.
10140056263301 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., 9862105879201 + 277950384100 = 3140399^2 + 527210^2 .
It is an emirp because it is prime and its reverse (10336265004101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10140056263301 - 26 = 10140056263237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10140056863301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070028131650 + 5070028131651.
It is an arithmetic number, because the mean of its divisors is an integer number (5070028131651).
Almost surely, 210140056263301 is an apocalyptic number.
It is an amenable number.
10140056263301 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140056263301 is an equidigital number, since it uses as much as digits as its factorization.
10140056263301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 10140056263301 in words is "ten trillion, one hundred forty billion, fifty-six million, two hundred sixty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •