Base | Representation |
---|---|
bin | 11010010111011011… |
… | …00010010100011101 |
3 | 1100112111101010010022 |
4 | 31023231202110131 |
5 | 212442203131031 |
6 | 10300333321525 |
7 | 1010530422665 |
oct | 151355422435 |
9 | 40474333108 |
10 | 14155130141 |
11 | 6004224869 |
12 | 28b06362a5 |
13 | 14477b5b69 |
14 | 983d391a5 |
15 | 57ca7797b |
hex | 34bb6251d |
14155130141 has 2 divisors, whose sum is σ = 14155130142. Its totient is φ = 14155130140.
The previous prime is 14155130117. The next prime is 14155130147. The reversal of 14155130141 is 14103155141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12089882116 + 2065248025 = 109954^2 + 45445^2 .
It is an emirp because it is prime and its reverse (14103155141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14155130141 - 218 = 14154867997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 14155130141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14155130147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7077565070 + 7077565071.
It is an arithmetic number, because the mean of its divisors is an integer number (7077565071).
Almost surely, 214155130141 is an apocalyptic number.
It is an amenable number.
14155130141 is a deficient number, since it is larger than the sum of its proper divisors (1).
14155130141 is an equidigital number, since it uses as much as digits as its factorization.
14155130141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 14155130141 its reverse (14103155141), we get a palindrome (28258285282).
The spelling of 14155130141 in words is "fourteen billion, one hundred fifty-five million, one hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •