Base | Representation |
---|---|
bin | 10111111000010101001101… |
… | …110110111000000111001001 |
3 | 111202212101211101022111000112 |
4 | 113320111031312320013021 |
5 | 102231222014212122304 |
6 | 1011212202054444105 |
7 | 31056613460151401 |
oct | 2770251566700711 |
9 | 452771741274015 |
10 | 105026141520329 |
11 | 30512377953897 |
12 | b94292a363635 |
13 | 467abcc0a0c23 |
14 | 1bd14143ab801 |
15 | c21e86eebb6e |
hex | 5f854ddb81c9 |
105026141520329 has 2 divisors, whose sum is σ = 105026141520330. Its totient is φ = 105026141520328.
The previous prime is 105026141520319. The next prime is 105026141520379. The reversal of 105026141520329 is 923025141620501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71269727779600 + 33756413740729 = 8442140^2 + 5810027^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105026141520329 is a prime.
It is a super-2 number, since 2×1050261415203292 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (105026141520319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52513070760164 + 52513070760165.
It is an arithmetic number, because the mean of its divisors is an integer number (52513070760165).
Almost surely, 2105026141520329 is an apocalyptic number.
It is an amenable number.
105026141520329 is a deficient number, since it is larger than the sum of its proper divisors (1).
105026141520329 is an equidigital number, since it uses as much as digits as its factorization.
105026141520329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 41.
The spelling of 105026141520329 in words is "one hundred five trillion, twenty-six billion, one hundred forty-one million, five hundred twenty thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •