Base | Representation |
---|---|
bin | 1000001100001100000… |
… | …0101111010100101111 |
3 | 111110012101000101221112 |
4 | 2003003000233110233 |
5 | 4301133420020211 |
6 | 144350330422235 |
7 | 13110641152613 |
oct | 2030300572457 |
9 | 443171011845 |
10 | 140710704431 |
11 | 54747584980 |
12 | 2332b89197b |
13 | 10365bab76b |
14 | 6b4bb91343 |
15 | 39d830a88b |
hex | 20c302f52f |
140710704431 has 8 divisors (see below), whose sum is σ = 161581670400. Its totient is φ = 121186252440.
The previous prime is 140710704427. The next prime is 140710704461. The reversal of 140710704431 is 134407017041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140710704431 - 22 = 140710704427 is a prime.
It is a super-2 number, since 2×1407107044312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140710704401) 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, 336628271 + ... + 336628688.
It is an arithmetic number, because the mean of its divisors is an integer number (20197708800).
Almost surely, 2140710704431 is an apocalyptic number.
140710704431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
140710704431 is a deficient number, since it is larger than the sum of its proper divisors (20870965969).
140710704431 is a wasteful number, since it uses less digits than its factorization.
140710704431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673256989.
The product of its (nonzero) digits is 9408, while the sum is 32.
The spelling of 140710704431 in words is "one hundred forty billion, seven hundred ten million, seven hundred four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •