Base | Representation |
---|---|
bin | 1000001010000000111… |
… | …1010101111011110101 |
3 | 111101200201021220201111 |
4 | 2002200033111323311 |
5 | 4243440044030122 |
6 | 144212410555021 |
7 | 13060325436622 |
oct | 2024017257365 |
9 | 441621256644 |
10 | 140127330037 |
11 | 54478252082 |
12 | 231a8438a71 |
13 | 102a2084406 |
14 | 6ad44d5349 |
15 | 39a1ec3d77 |
hex | 20a03d5ef5 |
140127330037 has 16 divisors (see below), whose sum is σ = 144356284800. Its totient is φ = 135939202560.
The previous prime is 140127329977. The next prime is 140127330061. The reversal of 140127330037 is 730033721041.
140127330037 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140127330037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140127329990 and 140127330008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140127330067) 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 15 ways as a sum of consecutive naturals, for example, 5223264 + ... + 5250022.
It is an arithmetic number, because the mean of its divisors is an integer number (9022267800).
Almost surely, 2140127330037 is an apocalyptic number.
It is an amenable number.
140127330037 is a deficient number, since it is larger than the sum of its proper divisors (4228954763).
140127330037 is a wasteful number, since it uses less digits than its factorization.
140127330037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27516.
The product of its (nonzero) digits is 10584, while the sum is 31.
The spelling of 140127330037 in words is "one hundred forty billion, one hundred twenty-seven million, three hundred thirty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •