Base | Representation |
---|---|
bin | 11111111000110100101011… |
… | …101100111010101000111101 |
3 | 200101120020001102101012102121 |
4 | 133320310223230322220331 |
5 | 121340230311334423401 |
6 | 1214135201522322541 |
7 | 41353213333464040 |
oct | 3770645354725075 |
9 | 611506042335377 |
10 | 140244300311101 |
11 | 407603014008a8 |
12 | 138903504b9451 |
13 | 6033c999b00bc |
14 | 268bc08b44c57 |
15 | 1133121c3dca1 |
hex | 7f8d2bb3aa3d |
140244300311101 has 16 divisors (see below), whose sum is σ = 161473341919104. Its totient is φ = 119316606050304.
The previous prime is 140244300311069. The next prime is 140244300311113. The reversal of 140244300311101 is 101113003442041.
It is a cyclic number.
It is not a de Polignac number, because 140244300311101 - 25 = 140244300311069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140244300311161) 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 15 ways as a sum of consecutive naturals, for example, 116566036 + ... + 117763021.
It is an arithmetic number, because the mean of its divisors is an integer number (10092083869944).
Almost surely, 2140244300311101 is an apocalyptic number.
It is an amenable number.
140244300311101 is a deficient number, since it is larger than the sum of its proper divisors (21229041608003).
140244300311101 is a wasteful number, since it uses less digits than its factorization.
140244300311101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234329700.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 140244300311101 its reverse (101113003442041), we get a palindrome (241357303753142).
The spelling of 140244300311101 in words is "one hundred forty trillion, two hundred forty-four billion, three hundred million, three hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •