Base | Representation |
---|---|
bin | 1000001001111100111… |
… | …0100111110111100111 |
3 | 111101122112100221212202 |
4 | 2002133032213313213 |
5 | 4243421223123020 |
6 | 144211003205115 |
7 | 13060031305430 |
oct | 2023716476747 |
9 | 441575327782 |
10 | 140110364135 |
11 | 54469714375 |
12 | 231a281679b |
13 | 1029b6c4011 |
14 | 6ad215a487 |
15 | 39a0771e75 |
hex | 209f3a7de7 |
140110364135 has 8 divisors (see below), whose sum is σ = 192151356576. Its totient is φ = 96075678240.
The previous prime is 140110364099. The next prime is 140110364137. The reversal of 140110364135 is 531463011041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140110364135 - 230 = 139036622311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140110364098 and 140110364107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140110364137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2001576596 + ... + 2001576665.
It is an arithmetic number, because the mean of its divisors is an integer number (24018919572).
Almost surely, 2140110364135 is an apocalyptic number.
140110364135 is a deficient number, since it is larger than the sum of its proper divisors (52040992441).
140110364135 is an equidigital number, since it uses as much as digits as its factorization.
140110364135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4003153273.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 140110364135 its reverse (531463011041), we get a palindrome (671573375176).
The spelling of 140110364135 in words is "one hundred forty billion, one hundred ten million, three hundred sixty-four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •