Base | Representation |
---|---|
bin | 110101011100010010… |
… | …0100001000101011101 |
3 | 101222020012222011002211 |
4 | 1222320210201011131 |
5 | 3340020011331031 |
6 | 124420031520421 |
7 | 11202000416266 |
oct | 1527044410535 |
9 | 358205864084 |
10 | 114765730141 |
11 | 44743298767 |
12 | 1a2aa989111 |
13 | aa8c962b7a |
14 | 57aa10196d |
15 | 2eba6c5bb1 |
hex | 1ab892115d |
114765730141 has 2 divisors, whose sum is σ = 114765730142. Its totient is φ = 114765730140.
The previous prime is 114765730139. The next prime is 114765730169. The reversal of 114765730141 is 141037567411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102926114041 + 11839616100 = 320821^2 + 108810^2 .
It is a cyclic number.
It is not a de Polignac number, because 114765730141 - 21 = 114765730139 is a prime.
Together with 114765730139, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 114765730094 and 114765730103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114765730171) 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, 57382865070 + 57382865071.
It is an arithmetic number, because the mean of its divisors is an integer number (57382865071).
Almost surely, 2114765730141 is an apocalyptic number.
It is an amenable number.
114765730141 is a deficient number, since it is larger than the sum of its proper divisors (1).
114765730141 is an equidigital number, since it uses as much as digits as its factorization.
114765730141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70560, while the sum is 40.
The spelling of 114765730141 in words is "one hundred fourteen billion, seven hundred sixty-five million, seven hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •