Base | Representation |
---|---|
bin | 1000001100100010101… |
… | …1010000000101100001 |
3 | 111110102222211110001002 |
4 | 2003020223100011201 |
5 | 4301332232003003 |
6 | 144404003321345 |
7 | 13113203666135 |
oct | 2031053200541 |
9 | 443388743032 |
10 | 140805734753 |
11 | 54796191632 |
12 | 23357680255 |
13 | 1037c7a2218 |
14 | 6b5a64b3c5 |
15 | 39e182ca88 |
hex | 20c8ad0161 |
140805734753 has 4 divisors (see below), whose sum is σ = 144080286768. Its totient is φ = 137531182740.
The previous prime is 140805734687. The next prime is 140805734779. The reversal of 140805734753 is 357437508041.
It is a happy number.
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 140805734753 - 28 = 140805734497 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140805734698 and 140805734707.
It is not an unprimeable number, because it can be changed into a prime (140805734053) 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, 1637275943 + ... + 1637276028.
It is an arithmetic number, because the mean of its divisors is an integer number (36020071692).
Almost surely, 2140805734753 is an apocalyptic number.
It is an amenable number.
140805734753 is a deficient number, since it is larger than the sum of its proper divisors (3274552015).
140805734753 is an equidigital number, since it uses as much as digits as its factorization.
140805734753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3274552014.
The product of its (nonzero) digits is 1411200, while the sum is 47.
The spelling of 140805734753 in words is "one hundred forty billion, eight hundred five million, seven hundred thirty-four thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •