Base | Representation |
---|---|
bin | 10110101111110010011101… |
… | …011110010101001001110111 |
3 | 111010012211100201010020102002 |
4 | 112233302131132111021313 |
5 | 101103033002134413221 |
6 | 552434113224405515 |
7 | 30033503512311254 |
oct | 2657623536251167 |
9 | 433184321106362 |
10 | 100041020232311 |
11 | 29970181947914 |
12 | b27875331689b |
13 | 43a8a9b69a762 |
14 | 1a9c022ab642b |
15 | b8746ab3280b |
hex | 5afc9d795277 |
100041020232311 has 2 divisors, whose sum is σ = 100041020232312. Its totient is φ = 100041020232310.
The previous prime is 100041020232299. The next prime is 100041020232407. The reversal of 100041020232311 is 113232020140001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100041020232311 - 246 = 29672276054647 is a prime.
It is a super-3 number, since 3×1000410202323113 (a number of 43 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100041020232511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50020510116155 + 50020510116156.
It is an arithmetic number, because the mean of its divisors is an integer number (50020510116156).
Almost surely, 2100041020232311 is an apocalyptic number.
100041020232311 is a deficient number, since it is larger than the sum of its proper divisors (1).
100041020232311 is an equidigital number, since it uses as much as digits as its factorization.
100041020232311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 100041020232311 its reverse (113232020140001), we get a palindrome (213273040372312).
The spelling of 100041020232311 in words is "one hundred trillion, forty-one billion, twenty million, two hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •