Base | Representation |
---|---|
bin | 1000001001101001000… |
… | …1001000101101001001 |
3 | 111101102201202120111101 |
4 | 2002122101020231021 |
5 | 4243233421334331 |
6 | 144154431301401 |
7 | 13055001011314 |
oct | 2023221105511 |
9 | 441381676441 |
10 | 140027136841 |
11 | 54426739489 |
12 | 2317a97a861 |
13 | 102873a39b7 |
14 | 6ac509397b |
15 | 39982d2061 |
hex | 209a448b49 |
140027136841 has 2 divisors, whose sum is σ = 140027136842. Its totient is φ = 140027136840.
The previous prime is 140027136791. The next prime is 140027136859. The reversal of 140027136841 is 148631720041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 137940931216 + 2086205625 = 371404^2 + 45675^2 .
It is a cyclic number.
It is not a de Polignac number, because 140027136841 - 225 = 139993582409 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140027136841.
It is not a weakly prime, because it can be changed into another prime (140027136241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70013568420 + 70013568421.
It is an arithmetic number, because the mean of its divisors is an integer number (70013568421).
Almost surely, 2140027136841 is an apocalyptic number.
It is an amenable number.
140027136841 is a deficient number, since it is larger than the sum of its proper divisors (1).
140027136841 is an equidigital number, since it uses as much as digits as its factorization.
140027136841 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32256, while the sum is 37.
Subtracting from 140027136841 its sum of digits (37), we obtain a square (140027136804 = 3742022).
Adding to 140027136841 its reverse (148631720041), we get a palindrome (288658856882).
The spelling of 140027136841 in words is "one hundred forty billion, twenty-seven million, one hundred thirty-six thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •