Base | Representation |
---|---|
bin | 1000001011111001000… |
… | …1000111001010110100 |
3 | 111102222211020121100122 |
4 | 2002332101013022310 |
5 | 4301003031012244 |
6 | 144334404431112 |
7 | 13105653500045 |
oct | 2027621071264 |
9 | 442884217318 |
10 | 140631110324 |
11 | 54706660721 |
12 | 233090a8498 |
13 | 10352561063 |
14 | 6b413928cc |
15 | 39d13371ee |
hex | 20be4472b4 |
140631110324 has 12 divisors (see below), whose sum is σ = 247614287424. Its totient is φ = 69884171064.
The previous prime is 140631110293. The next prime is 140631110327. The reversal of 140631110324 is 423011136041.
It is a happy number.
It is a super-2 number, since 2×1406311103242 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140631110293 and 140631110302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140631110327) 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 3 ways as a sum of consecutive naturals, for example, 107845292 + ... + 107846595.
It is an arithmetic number, because the mean of its divisors is an integer number (20634523952).
Almost surely, 2140631110324 is an apocalyptic number.
It is an amenable number.
140631110324 is a deficient number, since it is larger than the sum of its proper divisors (106983177100).
140631110324 is a wasteful number, since it uses less digits than its factorization.
140631110324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215692054 (or 215692052 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 140631110324 its reverse (423011136041), we get a palindrome (563642246365).
The spelling of 140631110324 in words is "one hundred forty billion, six hundred thirty-one million, one hundred ten thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •