Base | Representation |
---|---|
bin | 1000001011011111000… |
… | …1100001000100110011 |
3 | 111102201020020120211021 |
4 | 2002313301201010303 |
5 | 4300242133231111 |
6 | 144315513400311 |
7 | 13103161455610 |
oct | 2026761410463 |
9 | 442636216737 |
10 | 140522164531 |
11 | 5466010a081 |
12 | 23298709097 |
13 | 10335b077a8 |
14 | 6b30b13507 |
15 | 39c69b6d71 |
hex | 20b7c61133 |
140522164531 has 8 divisors (see below), whose sum is σ = 161525065824. Its totient is φ = 119751339840.
The previous prime is 140522164487. The next prime is 140522164537. The reversal of 140522164531 is 135461225041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140522164531 - 219 = 140521640243 is a prime.
It is a super-2 number, since 2×1405221645312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140522164537) 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 in 7 ways as a sum of consecutive naturals, for example, 58017850 + ... + 58020271.
It is an arithmetic number, because the mean of its divisors is an integer number (20190633228).
Almost surely, 2140522164531 is an apocalyptic number.
140522164531 is a deficient number, since it is larger than the sum of its proper divisors (21002901293).
140522164531 is a wasteful number, since it uses less digits than its factorization.
140522164531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116038301.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 140522164531 its reverse (135461225041), we get a palindrome (275983389572).
The spelling of 140522164531 in words is "one hundred forty billion, five hundred twenty-two million, one hundred sixty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •