Base | Representation |
---|---|
bin | 10011111100111100110… |
… | …010111000111111000101 |
3 | 11212002002022220102220221 |
4 | 103330330302320333011 |
5 | 134431020310302442 |
6 | 2525514211024341 |
7 | 201026332205605 |
oct | 23747462707705 |
9 | 4762068812827 |
10 | 1371114540997 |
11 | 489539460423 |
12 | 1a189359b0b1 |
13 | 9c3ac4141b6 |
14 | 4a510206c05 |
15 | 259ec2e0467 |
hex | 13f3ccb8fc5 |
1371114540997 has 2 divisors, whose sum is σ = 1371114540998. Its totient is φ = 1371114540996.
The previous prime is 1371114540979. The next prime is 1371114541063. The reversal of 1371114540997 is 7990454111731.
Together with previous prime (1371114540979) 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., 1360288346596 + 10826194401 = 1166314^2 + 104049^2 .
It is a cyclic number.
It is not a de Polignac number, because 1371114540997 - 239 = 821358727109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1371114640997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 685557270498 + 685557270499.
It is an arithmetic number, because the mean of its divisors is an integer number (685557270499).
Almost surely, 21371114540997 is an apocalyptic number.
It is an amenable number.
1371114540997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1371114540997 is an equidigital number, since it uses as much as digits as its factorization.
1371114540997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 952560, while the sum is 52.
The spelling of 1371114540997 in words is "one trillion, three hundred seventy-one billion, one hundred fourteen million, five hundred forty thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •