Base | Representation |
---|---|
bin | 10010101110111001… |
… | …010000001001110101 |
3 | 1220220210020211001101 |
4 | 102232321100021311 |
5 | 312143203110031 |
6 | 13123523130101 |
7 | 1311306066163 |
oct | 225671201165 |
9 | 56823224041 |
10 | 20114113141 |
11 | 859198aa01 |
12 | 3a94213931 |
13 | 1b872201c5 |
14 | d8b50c233 |
15 | 7cacac361 |
hex | 4aee50275 |
20114113141 has 2 divisors, whose sum is σ = 20114113142. Its totient is φ = 20114113140.
The previous prime is 20114113087. The next prime is 20114113169. The reversal of 20114113141 is 14131141102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17077001041 + 3037112100 = 130679^2 + 55110^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20114113141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20114113171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10057056570 + 10057056571.
It is an arithmetic number, because the mean of its divisors is an integer number (10057056571).
Almost surely, 220114113141 is an apocalyptic number.
It is an amenable number.
20114113141 is a deficient number, since it is larger than the sum of its proper divisors (1).
20114113141 is an equidigital number, since it uses as much as digits as its factorization.
20114113141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 20114113141 its reverse (14131141102), we get a palindrome (34245254243).
The spelling of 20114113141 in words is "twenty billion, one hundred fourteen million, one hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •