Base | Representation |
---|---|
bin | 10110110101000011110111… |
… | …111000001011110100101111 |
3 | 111011111110111121011022122102 |
4 | 112311003313320023310233 |
5 | 101130001441414242033 |
6 | 553312351254005315 |
7 | 30101620503320315 |
oct | 2665036770136457 |
9 | 434443447138572 |
10 | 100403314212143 |
11 | 29a9a896400178 |
12 | b316a0294683b |
13 | 4403cb82a1457 |
14 | 1ab17912100b5 |
15 | b91ac2126de8 |
hex | 5b50f7e0bd2f |
100403314212143 has 2 divisors, whose sum is σ = 100403314212144. Its totient is φ = 100403314212142.
The previous prime is 100403314212083. The next prime is 100403314212161. The reversal of 100403314212143 is 341212413304001.
It is a strong prime.
It is an emirp because it is prime and its reverse (341212413304001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100403314212143 - 212 = 100403314208047 is a prime.
It is a super-3 number, since 3×1004033142121433 (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 (100403314212163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50201657106071 + 50201657106072.
It is an arithmetic number, because the mean of its divisors is an integer number (50201657106072).
Almost surely, 2100403314212143 is an apocalyptic number.
100403314212143 is a deficient number, since it is larger than the sum of its proper divisors (1).
100403314212143 is an equidigital number, since it uses as much as digits as its factorization.
100403314212143 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 100403314212143 its reverse (341212413304001), we get a palindrome (441615727516144).
The spelling of 100403314212143 in words is "one hundred trillion, four hundred three billion, three hundred fourteen million, two hundred twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •