Base | Representation |
---|---|
bin | 10110110101100011000010… |
… | …000000000010101001111001 |
3 | 111011121122212012012111020012 |
4 | 112311203002000002221321 |
5 | 101131024001112243231 |
6 | 553340003140311305 |
7 | 30104213535214322 |
oct | 2665430200025171 |
9 | 434548765174205 |
10 | 100436770040441 |
11 | 2a002aa434114a |
12 | b32139b0a2535 |
13 | 44071ba608563 |
14 | 1ab32465d9449 |
15 | b928ce334e2b |
hex | 5b58c2002a79 |
100436770040441 has 2 divisors, whose sum is σ = 100436770040442. Its totient is φ = 100436770040440.
The previous prime is 100436770040437. The next prime is 100436770040443. The reversal of 100436770040441 is 144040077634001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 59011649065216 + 41425120975225 = 7681904^2 + 6436235^2 .
It is a cyclic number.
It is not a de Polignac number, because 100436770040441 - 22 = 100436770040437 is a prime.
Together with 100436770040443, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (100436770040443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50218385020220 + 50218385020221.
It is an arithmetic number, because the mean of its divisors is an integer number (50218385020221).
Almost surely, 2100436770040441 is an apocalyptic number.
It is an amenable number.
100436770040441 is a deficient number, since it is larger than the sum of its proper divisors (1).
100436770040441 is an equidigital number, since it uses as much as digits as its factorization.
100436770040441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 225792, while the sum is 41.
The spelling of 100436770040441 in words is "one hundred trillion, four hundred thirty-six billion, seven hundred seventy million, forty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •