Base | Representation |
---|---|
bin | 1000001011000001111… |
… | …1101111100010001011 |
3 | 111102101201111021021111 |
4 | 2002300133233202023 |
5 | 4300014404032101 |
6 | 144255432351151 |
7 | 13100146600360 |
oct | 2026037574213 |
9 | 442351437244 |
10 | 140400064651 |
11 | 545a81a3690 |
12 | 232638454b7 |
13 | 10316726b42 |
14 | 6b1c80c467 |
15 | 39bade9251 |
hex | 20b07ef88b |
140400064651 has 64 divisors (see below), whose sum is σ = 186226606080. Its totient is φ = 102614117760.
The previous prime is 140400064589. The next prime is 140400064657. The reversal of 140400064651 is 156460004041.
140400064651 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 140400064651 - 29 = 140400064139 is a prime.
It is not an unprimeable number, because it can be changed into a prime (140400064657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 27169870 + ... + 27175036.
It is an arithmetic number, because the mean of its divisors is an integer number (2909790720).
Almost surely, 2140400064651 is an apocalyptic number.
140400064651 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
140400064651 is a deficient number, since it is larger than the sum of its proper divisors (45826541429).
140400064651 is a wasteful number, since it uses less digits than its factorization.
140400064651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5504.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 140400064651 its reverse (156460004041), we get a palindrome (296860068692).
The spelling of 140400064651 in words is "one hundred forty billion, four hundred million, sixty-four thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •