Base | Representation |
---|---|
bin | 110101001000100100… |
… | …0001111001000001101 |
3 | 101220112002211001001012 |
4 | 1222101020033020031 |
5 | 3332141111131013 |
6 | 124230232455005 |
7 | 11146414016666 |
oct | 1522110171015 |
9 | 356462731035 |
10 | 114104005133 |
11 | 44433810998 |
12 | 1a14524a465 |
13 | a9b5835101 |
14 | 574628c36d |
15 | 2e7c5641a8 |
hex | 1a9120f20d |
114104005133 has 2 divisors, whose sum is σ = 114104005134. Its totient is φ = 114104005132.
The previous prime is 114104005109. The next prime is 114104005157. The reversal of 114104005133 is 331500401411.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (114104005109) and next prime (114104005157).
It can be written as a sum of positive squares in only one way, i.e., 94237948324 + 19866056809 = 306982^2 + 140947^2 .
It is a cyclic number.
It is not a de Polignac number, because 114104005133 - 210 = 114104004109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114104005099 and 114104005108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114104065133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57052002566 + 57052002567.
It is an arithmetic number, because the mean of its divisors is an integer number (57052002567).
Almost surely, 2114104005133 is an apocalyptic number.
It is an amenable number.
114104005133 is a deficient number, since it is larger than the sum of its proper divisors (1).
114104005133 is an equidigital number, since it uses as much as digits as its factorization.
114104005133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 114104005133 its reverse (331500401411), we get a palindrome (445604406544).
The spelling of 114104005133 in words is "one hundred fourteen billion, one hundred four million, five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •