Base | Representation |
---|---|
bin | 11111111000110001111001… |
… | …101010111000011000001101 |
3 | 200101112221100021001002002111 |
4 | 133320301321222320120031 |
5 | 121340203202214324401 |
6 | 1214133545303224021 |
7 | 41353046324442646 |
oct | 3770617152703015 |
9 | 611487307032074 |
10 | 140241313433101 |
11 | 4075a009393191 |
12 | 1388b858148011 |
13 | 6033911c4147a |
14 | 268ba041966cd |
15 | 1132ee98dce51 |
hex | 7f8c79ab860d |
140241313433101 has 2 divisors, whose sum is σ = 140241313433102. Its totient is φ = 140241313433100.
The previous prime is 140241313433029. The next prime is 140241313433161. The reversal of 140241313433101 is 101334313142041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 137431097056201 + 2810216376900 = 11723101^2 + 1676370^2 .
It is a cyclic number.
It is not a de Polignac number, because 140241313433101 - 217 = 140241313302029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140241313433161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70120656716550 + 70120656716551.
It is an arithmetic number, because the mean of its divisors is an integer number (70120656716551).
Almost surely, 2140241313433101 is an apocalyptic number.
It is an amenable number.
140241313433101 is a deficient number, since it is larger than the sum of its proper divisors (1).
140241313433101 is an equidigital number, since it uses as much as digits as its factorization.
140241313433101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 140241313433101 its reverse (101334313142041), we get a palindrome (241575626575142).
The spelling of 140241313433101 in words is "one hundred forty trillion, two hundred forty-one billion, three hundred thirteen million, four hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •