Base | Representation |
---|---|
bin | 1000001011011010110… |
… | …1111111100001000111 |
3 | 111102122222221021110222 |
4 | 2002312231333201013 |
5 | 4300223120312211 |
6 | 144314042134555 |
7 | 13102555143113 |
oct | 2026655774107 |
9 | 442588837428 |
10 | 140504463431 |
11 | 54651119a72 |
12 | 232927b145b |
13 | 1033224a877 |
14 | 6b2c626743 |
15 | 39c516c1db |
hex | 20b6b7f847 |
140504463431 has 8 divisors (see below), whose sum is σ = 141960698880. Its totient is φ = 139048386048.
The previous prime is 140504463427. The next prime is 140504463439. The reversal of 140504463431 is 134364405041.
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 140504463431 - 22 = 140504463427 is a prime.
It is a super-2 number, since 2×1405044634312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140504463391 and 140504463400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140504463439) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2789690 + ... + 2839608.
It is an arithmetic number, because the mean of its divisors is an integer number (17745087360).
Almost surely, 2140504463431 is an apocalyptic number.
140504463431 is a deficient number, since it is larger than the sum of its proper divisors (1456235449).
140504463431 is an equidigital number, since it uses as much as digits as its factorization.
140504463431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79033.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 140504463431 its reverse (134364405041), we get a palindrome (274868868472).
The spelling of 140504463431 in words is "one hundred forty billion, five hundred four million, four hundred sixty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •