Base | Representation |
---|---|
bin | 11111111000010111101000… |
… | …101100010010010011001011 |
3 | 200101110020112210202100021022 |
4 | 133320113220230102103023 |
5 | 121334222422443120243 |
6 | 1214113003013503055 |
7 | 41351030415332264 |
oct | 3770275054222313 |
9 | 611406483670238 |
10 | 140213111301323 |
11 | 40749056a88165 |
12 | 138862a7341a8b |
13 | 60310691a1028 |
14 | 268a4ca82b96b |
15 | 11323e8a4ab68 |
hex | 7f85e8b124cb |
140213111301323 has 2 divisors, whose sum is σ = 140213111301324. Its totient is φ = 140213111301322.
The previous prime is 140213111301317. The next prime is 140213111301343. The reversal of 140213111301323 is 323103111312041.
It is a weak prime.
It is an emirp because it is prime and its reverse (323103111312041) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140213111301323 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140213111301292 and 140213111301301.
It is not a weakly prime, because it can be changed into another prime (140213111301343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70106555650661 + 70106555650662.
It is an arithmetic number, because the mean of its divisors is an integer number (70106555650662).
Almost surely, 2140213111301323 is an apocalyptic number.
140213111301323 is a deficient number, since it is larger than the sum of its proper divisors (1).
140213111301323 is an equidigital number, since it uses as much as digits as its factorization.
140213111301323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 140213111301323 its reverse (323103111312041), we get a palindrome (463316222613364).
The spelling of 140213111301323 in words is "one hundred forty trillion, two hundred thirteen billion, one hundred eleven million, three hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •