Base | Representation |
---|---|
bin | 10110110101000011111000… |
… | …001111001100000001010111 |
3 | 111011111110112000111200102012 |
4 | 112311003320033030001113 |
5 | 101130001444440223023 |
6 | 553312352031134435 |
7 | 30101620605503663 |
oct | 2665037017140127 |
9 | 434443460450365 |
10 | 100403320242263 |
11 | 29a9a899849745 |
12 | b316a0497441b |
13 | 4403cb960307c |
14 | 1ab1791d3d8a3 |
15 | b91ac2918978 |
hex | 5b50f83cc057 |
100403320242263 has 2 divisors, whose sum is σ = 100403320242264. Its totient is φ = 100403320242262.
The previous prime is 100403320242223. The next prime is 100403320242331. The reversal of 100403320242263 is 362242023304001.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100403320242263 is a prime.
It is a super-2 number, since 2×1004033202422632 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100403320242223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50201660121131 + 50201660121132.
It is an arithmetic number, because the mean of its divisors is an integer number (50201660121132).
Almost surely, 2100403320242263 is an apocalyptic number.
100403320242263 is a deficient number, since it is larger than the sum of its proper divisors (1).
100403320242263 is an equidigital number, since it uses as much as digits as its factorization.
100403320242263 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 100403320242263 its reverse (362242023304001), we get a palindrome (462645343546264).
The spelling of 100403320242263 in words is "one hundred trillion, four hundred three billion, three hundred twenty million, two hundred forty-two thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •