Base | Representation |
---|---|
bin | 11111111001110110111100… |
… | …010100101101000101011101 |
3 | 200101211000200200210122012011 |
4 | 133321312330110231011131 |
5 | 121342412013202342211 |
6 | 1214232005344311221 |
7 | 41361312363151360 |
oct | 3771667424550535 |
9 | 611730620718164 |
10 | 140315446137181 |
11 | 407884a0367a77 |
12 | 138a20a7012511 |
13 | 603a8c7631a43 |
14 | 26914379c80d7 |
15 | 1134dd7c38921 |
hex | 7f9dbc52d15d |
140315446137181 has 32 divisors (see below), whose sum is σ = 165710460151808. Its totient is φ = 116313547734720.
The previous prime is 140315446137161. The next prime is 140315446137199. The reversal of 140315446137181 is 181731644513041.
It is not a de Polignac number, because 140315446137181 - 25 = 140315446137149 is a prime.
It is a super-2 number, since 2×1403154461371812 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140315446137161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 187722211 + ... + 188468191.
It is an arithmetic number, because the mean of its divisors is an integer number (5178451879744).
Almost surely, 2140315446137181 is an apocalyptic number.
It is an amenable number.
140315446137181 is a deficient number, since it is larger than the sum of its proper divisors (25395014014627).
140315446137181 is a wasteful number, since it uses less digits than its factorization.
140315446137181 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 752201.
The product of its (nonzero) digits is 967680, while the sum is 49.
The spelling of 140315446137181 in words is "one hundred forty trillion, three hundred fifteen billion, four hundred forty-six million, one hundred thirty-seven thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •