Base | Representation |
---|---|
bin | 1000001011110101010… |
… | …1010011010001011101 |
3 | 111102221201202000201121 |
4 | 2002331111103101131 |
5 | 4300440022300021 |
6 | 144333044410541 |
7 | 13105403305354 |
oct | 2027525232135 |
9 | 442851660647 |
10 | 140615431261 |
11 | 546a8821818 |
12 | 233039a6a51 |
13 | 1034c2315c6 |
14 | 6b3d27099b |
15 | 39cec8b741 |
hex | 20bd55345d |
140615431261 has 2 divisors, whose sum is σ = 140615431262. Its totient is φ = 140615431260.
The previous prime is 140615431259. The next prime is 140615431283. The reversal of 140615431261 is 162134516041.
140615431261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 139143174361 + 1472256900 = 373019^2 + 38370^2 .
It is a cyclic number.
It is not a de Polignac number, because 140615431261 - 21 = 140615431259 is a prime.
Together with 140615431259, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140615431241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70307715630 + 70307715631.
It is an arithmetic number, because the mean of its divisors is an integer number (70307715631).
Almost surely, 2140615431261 is an apocalyptic number.
It is an amenable number.
140615431261 is a deficient number, since it is larger than the sum of its proper divisors (1).
140615431261 is an equidigital number, since it uses as much as digits as its factorization.
140615431261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 34.
The spelling of 140615431261 in words is "one hundred forty billion, six hundred fifteen million, four hundred thirty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •