Base | Representation |
---|---|
bin | 110101001001101100… |
… | …1001110001011100101 |
3 | 101220121202022222211212 |
4 | 1222103121032023211 |
5 | 3332230323342013 |
6 | 124234111241205 |
7 | 11150355044402 |
oct | 1522331161345 |
9 | 356552288755 |
10 | 114142012133 |
11 | 44453210136 |
12 | 1a155b19205 |
13 | a9c0681766 |
14 | 574b3432a9 |
15 | 2e80a706a8 |
hex | 1a9364e2e5 |
114142012133 has 2 divisors, whose sum is σ = 114142012134. Its totient is φ = 114142012132.
The previous prime is 114142012097. The next prime is 114142012181. The reversal of 114142012133 is 331210241411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112585078369 + 1556933764 = 335537^2 + 39458^2 .
It is a cyclic number.
It is not a de Polignac number, because 114142012133 - 230 = 113068270309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114142012099 and 114142012108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114142012433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57071006066 + 57071006067.
It is an arithmetic number, because the mean of its divisors is an integer number (57071006067).
Almost surely, 2114142012133 is an apocalyptic number.
It is an amenable number.
114142012133 is a deficient number, since it is larger than the sum of its proper divisors (1).
114142012133 is an equidigital number, since it uses as much as digits as its factorization.
114142012133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 114142012133 its reverse (331210241411), we get a palindrome (445352253544).
The spelling of 114142012133 in words is "one hundred fourteen billion, one hundred forty-two million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •