Base | Representation |
---|---|
bin | 1000001010000000010… |
… | …0111101010011000001 |
3 | 111101200112011121100111 |
4 | 2002200010331103001 |
5 | 4243433344421211 |
6 | 144212232351321 |
7 | 13060263341002 |
oct | 2024004752301 |
9 | 441615147314 |
10 | 140124607681 |
11 | 544767627a3 |
12 | 231a7545541 |
13 | 102a1640256 |
14 | 6ad3dc71a9 |
15 | 39a1b37421 |
hex | 20a013d4c1 |
140124607681 has 4 divisors (see below), whose sum is σ = 146216981952. Its totient is φ = 134032233412.
The previous prime is 140124607639. The next prime is 140124607687. The reversal of 140124607681 is 186706421041.
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 140124607681 - 29 = 140124607169 is a prime.
It is a super-2 number, since 2×1401246076812 (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 (140124607687) 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, 3046187101 + ... + 3046187146.
It is an arithmetic number, because the mean of its divisors is an integer number (36554245488).
Almost surely, 2140124607681 is an apocalyptic number.
It is an amenable number.
140124607681 is a deficient number, since it is larger than the sum of its proper divisors (6092374271).
140124607681 is an equidigital number, since it uses as much as digits as its factorization.
140124607681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6092374270.
The product of its (nonzero) digits is 64512, while the sum is 40.
The spelling of 140124607681 in words is "one hundred forty billion, one hundred twenty-four million, six hundred seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •