Base | Representation |
---|---|
bin | 10111000011101110101110… |
… | …011111000110011100011111 |
3 | 111022001211112211211012210221 |
4 | 113003232232133012130133 |
5 | 101243011021423324203 |
6 | 555403430515342211 |
7 | 30234506015051554 |
oct | 2703565637063437 |
9 | 438054484735727 |
10 | 101411400214303 |
11 | 2a3493736a4183 |
12 | b45a2608b1967 |
13 | 447809186244a |
14 | 1b084a350aa2b |
15 | bace236c5abd |
hex | 5c3bae7c671f |
101411400214303 has 2 divisors, whose sum is σ = 101411400214304. Its totient is φ = 101411400214302.
The previous prime is 101411400214219. The next prime is 101411400214343. The reversal of 101411400214303 is 303412004114101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101411400214303 - 29 = 101411400213791 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101411400214343) 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, 50705700107151 + 50705700107152.
It is an arithmetic number, because the mean of its divisors is an integer number (50705700107152).
Almost surely, 2101411400214303 is an apocalyptic number.
101411400214303 is a deficient number, since it is larger than the sum of its proper divisors (1).
101411400214303 is an equidigital number, since it uses as much as digits as its factorization.
101411400214303 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 101411400214303 its reverse (303412004114101), we get a palindrome (404823404328404).
The spelling of 101411400214303 in words is "one hundred one trillion, four hundred eleven billion, four hundred million, two hundred fourteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •