Base | Representation |
---|---|
bin | 11111111001111100001001… |
… | …001001110101100001101101 |
3 | 200101211120002212000101122200 |
4 | 133321330021021311201231 |
5 | 121343004432201213401 |
6 | 1214234331420132113 |
7 | 41361600636105513 |
oct | 3771741111654155 |
9 | 611746085011580 |
10 | 140321030101101 |
11 | 4078a8a636a793 |
12 | 138a31a5097039 |
13 | 603b2a74630c5 |
14 | 269180745a4b3 |
15 | 1135113091686 |
hex | 7f9f0927586d |
140321030101101 has 24 divisors (see below), whose sum is σ = 209229777679104. Its totient is φ = 90527278337280.
The previous prime is 140321030101073. The next prime is 140321030101159. The reversal of 140321030101101 is 101101030123041.
It is a happy number.
140321030101101 is a `hidden beast` number, since 1 + 40 + 3 + 210 + 301 + 0 + 110 + 1 = 666.
It is not a de Polignac number, because 140321030101101 - 211 = 140321030099053 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140321030101501) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3773530 + ... + 17172116.
It is an arithmetic number, because the mean of its divisors is an integer number (8717907403296).
Almost surely, 2140321030101101 is an apocalyptic number.
It is an amenable number.
140321030101101 is a deficient number, since it is larger than the sum of its proper divisors (68908747578003).
140321030101101 is a wasteful number, since it uses less digits than its factorization.
140321030101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13436161 (or 13436158 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 140321030101101 its reverse (101101030123041), we get a palindrome (241422060224142).
The spelling of 140321030101101 in words is "one hundred forty trillion, three hundred twenty-one billion, thirty million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •