Base | Representation |
---|---|
bin | 1000001001111110000… |
… | …1100110001100100101 |
3 | 111101122212201122202202 |
4 | 2002133201212030211 |
5 | 4243424011304041 |
6 | 144211301544245 |
7 | 13060121502521 |
oct | 2023741461445 |
9 | 441585648682 |
10 | 140115338021 |
11 | 5447150131a |
12 | 231a4415085 |
13 | 1029c745c49 |
14 | 6ad2a92d81 |
15 | 39a0e05a9b |
hex | 209f866325 |
140115338021 has 2 divisors, whose sum is σ = 140115338022. Its totient is φ = 140115338020.
The previous prime is 140115338017. The next prime is 140115338039. The reversal of 140115338021 is 120833511041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 139494780100 + 620557921 = 373490^2 + 24911^2 .
It is an emirp because it is prime and its reverse (120833511041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140115338021 - 22 = 140115338017 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140115338071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70057669010 + 70057669011.
It is an arithmetic number, because the mean of its divisors is an integer number (70057669011).
Almost surely, 2140115338021 is an apocalyptic number.
It is an amenable number.
140115338021 is a deficient number, since it is larger than the sum of its proper divisors (1).
140115338021 is an equidigital number, since it uses as much as digits as its factorization.
140115338021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 29.
Adding to 140115338021 its reverse (120833511041), we get a palindrome (260948849062).
The spelling of 140115338021 in words is "one hundred forty billion, one hundred fifteen million, three hundred thirty-eight thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •