Base | Representation |
---|---|
bin | 1001001110010001010101… |
… | …1001010100001000010001 |
3 | 1022220110010011111210021011 |
4 | 2103210111121110020101 |
5 | 2312121302321242231 |
6 | 33322335235130521 |
7 | 2064434621045611 |
oct | 223442531241021 |
9 | 38813104453234 |
10 | 10140776743441 |
11 | 325a752113a93 |
12 | 1179425743a41 |
13 | 58736a919906 |
14 | 270b5d990a41 |
15 | 128bb8e459b1 |
hex | 93915654211 |
10140776743441 has 2 divisors, whose sum is σ = 10140776743442. Its totient is φ = 10140776743440.
The previous prime is 10140776743397. The next prime is 10140776743519. The reversal of 10140776743441 is 14434767704101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5882909571841 + 4257867171600 = 2425471^2 + 2063460^2 .
It is an emirp because it is prime and its reverse (14434767704101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10140776743441 - 213 = 10140776735249 is a prime.
It is not a weakly prime, because it can be changed into another prime (10140776741441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070388371720 + 5070388371721.
It is an arithmetic number, because the mean of its divisors is an integer number (5070388371721).
Almost surely, 210140776743441 is an apocalyptic number.
It is an amenable number.
10140776743441 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140776743441 is an equidigital number, since it uses as much as digits as its factorization.
10140776743441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1580544, while the sum is 49.
The spelling of 10140776743441 in words is "ten trillion, one hundred forty billion, seven hundred seventy-six million, seven hundred forty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •