Base | Representation |
---|---|
bin | 11111110111100001100100… |
… | …010011001011001000100101 |
3 | 200101020200200210121122200212 |
4 | 133313201210103023020211 |
5 | 121332300023210113023 |
6 | 1214030202121345205 |
7 | 41343603634522106 |
oct | 3767414423131045 |
9 | 611220623548625 |
10 | 140155055551013 |
11 | 40726475029728 |
12 | 13876ba4638205 |
13 | 602874649b659 |
14 | 26877802803ad |
15 | 1130b4bd46e78 |
hex | 7f78644cb225 |
140155055551013 has 2 divisors, whose sum is σ = 140155055551014. Its totient is φ = 140155055551012.
The previous prime is 140155055551001. The next prime is 140155055551031. The reversal of 140155055551013 is 310155550551041.
Together with next prime (140155055551031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104923494509089 + 35231561041924 = 10243217^2 + 5935618^2 .
It is a cyclic number.
It is not a de Polignac number, because 140155055551013 - 210 = 140155055549989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140155055553013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70077527775506 + 70077527775507.
It is an arithmetic number, because the mean of its divisors is an integer number (70077527775507).
Almost surely, 2140155055551013 is an apocalyptic number.
It is an amenable number.
140155055551013 is a deficient number, since it is larger than the sum of its proper divisors (1).
140155055551013 is an equidigital number, since it uses as much as digits as its factorization.
140155055551013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 187500, while the sum is 41.
The spelling of 140155055551013 in words is "one hundred forty trillion, one hundred fifty-five billion, fifty-five million, five hundred fifty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •