Base | Representation |
---|---|
bin | 11111110111001100001100… |
… | …110100110010011100100111 |
3 | 200101011111110220101222102100 |
4 | 133313030030310302130213 |
5 | 121331411031430200203 |
6 | 1214011445401543143 |
7 | 41342132253261066 |
oct | 3767141464623447 |
9 | 611144426358370 |
10 | 140132113131303 |
11 | 40717771698187 |
12 | 138726611a4ab3 |
13 | 602652b31cc87 |
14 | 26866052a01dd |
15 | 1130257b0cea3 |
hex | 7f730cd32727 |
140132113131303 has 12 divisors (see below), whose sum is σ = 203771529163800. Its totient is φ = 92794419432816.
The previous prime is 140132113131247. The next prime is 140132113131343. The reversal of 140132113131303 is 303131311231041.
140132113131303 is a `hidden beast` number, since 1 + 4 + 0 + 1 + 3 + 211 + 313 + 130 + 3 = 666.
It is not a de Polignac number, because 140132113131303 - 213 = 140132113123111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140132113131343) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 52249108701 + ... + 52249111382.
It is an arithmetic number, because the mean of its divisors is an integer number (16980960763650).
Almost surely, 2140132113131303 is an apocalyptic number.
140132113131303 is a deficient number, since it is larger than the sum of its proper divisors (63639416032497).
140132113131303 is a wasteful number, since it uses less digits than its factorization.
140132113131303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104498220238 (or 104498220235 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
Adding to 140132113131303 its reverse (303131311231041), we get a palindrome (443263424362344).
The spelling of 140132113131303 in words is "one hundred forty trillion, one hundred thirty-two billion, one hundred thirteen million, one hundred thirty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •