Base | Representation |
---|---|
bin | 10110110010101101111011… |
… | …010011111101101000100111 |
3 | 111010221001220222100221220102 |
4 | 112302231323103331220213 |
5 | 101114332223000131403 |
6 | 553110403130454315 |
7 | 30054160621640456 |
oct | 2662557323755047 |
9 | 433831828327812 |
10 | 100242310552103 |
11 | 29a38585aa4405 |
12 | b2ab76ab9439b |
13 | 43c1a6a115765 |
14 | 1aa7a7a2b8b9d |
15 | b8c7ec4d3b88 |
hex | 5b2b7b4fda27 |
100242310552103 has 2 divisors, whose sum is σ = 100242310552104. Its totient is φ = 100242310552102.
The previous prime is 100242310552049. The next prime is 100242310552183. The reversal of 100242310552103 is 301255013242001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100242310552103 - 28 = 100242310551847 is a prime.
It is a super-3 number, since 3×1002423105521033 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100242310552183) 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, 50121155276051 + 50121155276052.
It is an arithmetic number, because the mean of its divisors is an integer number (50121155276052).
Almost surely, 2100242310552103 is an apocalyptic number.
100242310552103 is a deficient number, since it is larger than the sum of its proper divisors (1).
100242310552103 is an equidigital number, since it uses as much as digits as its factorization.
100242310552103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 100242310552103 its reverse (301255013242001), we get a palindrome (401497323794104).
The spelling of 100242310552103 in words is "one hundred trillion, two hundred forty-two billion, three hundred ten million, five hundred fifty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •