Base | Representation |
---|---|
bin | 1000001010010101111… |
… | …0111110001100111101 |
3 | 111101220211211220221122 |
4 | 2002211132332030331 |
5 | 4244130110010323 |
6 | 144225232440325 |
7 | 13062444332423 |
oct | 2024536761475 |
9 | 441824756848 |
10 | 140215313213 |
11 | 54512986148 |
12 | 232119a90a5 |
13 | 102b737b371 |
14 | 6b02079113 |
15 | 39a9aa2ec8 |
hex | 20a57be33d |
140215313213 has 4 divisors (see below), whose sum is σ = 147595066560. Its totient is φ = 132835559868.
The previous prime is 140215313197. The next prime is 140215313233. The reversal of 140215313213 is 312313512041.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 312313512041 = 131 ⋅2384072611.
It is a cyclic number.
It is not a de Polignac number, because 140215313213 - 24 = 140215313197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140215313233) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3689876645 + ... + 3689876682.
It is an arithmetic number, because the mean of its divisors is an integer number (36898766640).
Almost surely, 2140215313213 is an apocalyptic number.
It is an amenable number.
140215313213 is a deficient number, since it is larger than the sum of its proper divisors (7379753347).
140215313213 is an equidigital number, since it uses as much as digits as its factorization.
140215313213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7379753346.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 140215313213 its reverse (312313512041), we get a palindrome (452528825254).
The spelling of 140215313213 in words is "one hundred forty billion, two hundred fifteen million, three hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •