Base | Representation |
---|---|
bin | 11111111000010111101000… |
… | …000010011010011001001111 |
3 | 200101110020112001002122210202 |
4 | 133320113220002122121033 |
5 | 121334222412140340211 |
6 | 1214113001542324115 |
7 | 41351030223123551 |
oct | 3770275002323117 |
9 | 611406461078722 |
10 | 140213100324431 |
11 | 40749050870052 |
12 | 138862a372963b |
13 | 6031066b29924 |
14 | 268a4c91b14d1 |
15 | 11323e7acd53b |
hex | 7f85e809a64f |
140213100324431 has 2 divisors, whose sum is σ = 140213100324432. Its totient is φ = 140213100324430.
The previous prime is 140213100324301. The next prime is 140213100324449. The reversal of 140213100324431 is 134423001312041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140213100324431 - 210 = 140213100323407 is a prime.
It is a super-2 number, since 2×1402131003244312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140213100324394 and 140213100324403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140213100324491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70106550162215 + 70106550162216.
It is an arithmetic number, because the mean of its divisors is an integer number (70106550162216).
Almost surely, 2140213100324431 is an apocalyptic number.
140213100324431 is a deficient number, since it is larger than the sum of its proper divisors (1).
140213100324431 is an equidigital number, since it uses as much as digits as its factorization.
140213100324431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 140213100324431 its reverse (134423001312041), we get a palindrome (274636101636472).
The spelling of 140213100324431 in words is "one hundred forty trillion, two hundred thirteen billion, one hundred million, three hundred twenty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •