Base | Representation |
---|---|
bin | 1000001011001011100… |
… | …1110011110010010011 |
3 | 111102111112111011122020 |
4 | 2002302321303302103 |
5 | 4300110223432433 |
6 | 144303434142523 |
7 | 13101150101430 |
oct | 2026271636223 |
9 | 442445434566 |
10 | 140440452243 |
11 | 54618a79463 |
12 | 23275281a43 |
13 | 10321bc7c20 |
14 | 6b23d22b87 |
15 | 39be725cb3 |
hex | 20b2e73c93 |
140440452243 has 32 divisors (see below), whose sum is σ = 230842622976. Its totient is φ = 73957546368.
The previous prime is 140440452233. The next prime is 140440452277. The reversal of 140440452243 is 342254044041.
140440452243 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 140440452243 - 25 = 140440452211 is a prime.
It is not an unprimeable number, because it can be changed into a prime (140440452223) 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 31 ways as a sum of consecutive naturals, for example, 252255 + ... + 586952.
It is an arithmetic number, because the mean of its divisors is an integer number (7213831968).
Almost surely, 2140440452243 is an apocalyptic number.
140440452243 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
140440452243 is a deficient number, since it is larger than the sum of its proper divisors (90402170733).
140440452243 is a wasteful number, since it uses less digits than its factorization.
140440452243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 839843.
The product of its (nonzero) digits is 61440, while the sum is 33.
Adding to 140440452243 its reverse (342254044041), we get a palindrome (482694496284).
The spelling of 140440452243 in words is "one hundred forty billion, four hundred forty million, four hundred fifty-two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •