Base | Representation |
---|---|
bin | 10111000010001000111100… |
… | …111100000001111110010111 |
3 | 111021200101110222201121120012 |
4 | 113002020330330001332113 |
5 | 101234213220434410033 |
6 | 555241315115030435 |
7 | 30223556665136501 |
oct | 2702107474017627 |
9 | 437611428647505 |
10 | 101302121013143 |
11 | 2a306a96409996 |
12 | b44104343b41b |
13 | 446a9977a783b |
14 | 1b03097d56d71 |
15 | baa179a0d248 |
hex | 5c223cf01f97 |
101302121013143 has 2 divisors, whose sum is σ = 101302121013144. Its totient is φ = 101302121013142.
The previous prime is 101302121013133. The next prime is 101302121013151. The reversal of 101302121013143 is 341310121203101.
It is a strong prime.
It is an emirp because it is prime and its reverse (341310121203101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101302121013143 - 228 = 101301852577687 is a prime.
It is a super-2 number, since 2×1013021210131432 (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 (101302121013133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50651060506571 + 50651060506572.
It is an arithmetic number, because the mean of its divisors is an integer number (50651060506572).
Almost surely, 2101302121013143 is an apocalyptic number.
101302121013143 is a deficient number, since it is larger than the sum of its proper divisors (1).
101302121013143 is an equidigital number, since it uses as much as digits as its factorization.
101302121013143 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 101302121013143 its reverse (341310121203101), we get a palindrome (442612242216244).
The spelling of 101302121013143 in words is "one hundred one trillion, three hundred two billion, one hundred twenty-one million, thirteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •