Base | Representation |
---|---|
bin | 10000101111100… |
… | …00011101100001 |
3 | 100210021101001120 |
4 | 20113300131201 |
5 | 241423224122 |
6 | 21534122453 |
7 | 3323524131 |
oct | 1027603541 |
9 | 323241046 |
10 | 140445537 |
11 | 723068a1 |
12 | 3b050429 |
13 | 2313508b |
14 | 1491cac1 |
15 | c4e375c |
hex | 85f0761 |
140445537 has 4 divisors (see below), whose sum is σ = 187260720. Its totient is φ = 93630356.
The previous prime is 140445533. The next prime is 140445563. The reversal of 140445537 is 735544041.
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.
It is a cyclic number.
It is not a de Polignac number, because 140445537 - 22 = 140445533 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140445498 and 140445507.
It is not an unprimeable number, because it can be changed into a prime (140445533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23407587 + ... + 23407592.
It is an arithmetic number, because the mean of its divisors is an integer number (46815180).
Almost surely, 2140445537 is an apocalyptic number.
It is an amenable number.
140445537 is a deficient number, since it is larger than the sum of its proper divisors (46815183).
140445537 is an equidigital number, since it uses as much as digits as its factorization.
140445537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46815182.
The product of its (nonzero) digits is 33600, while the sum is 33.
The square root of 140445537 is about 11850.9719854533. The cubic root of 140445537 is about 519.7996479144.
Adding to 140445537 its reverse (735544041), we get a palindrome (875989578).
The spelling of 140445537 in words is "one hundred forty million, four hundred forty-five thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •