Base | Representation |
---|---|
bin | 110100110100110010… |
… | …0111100001100101101 |
3 | 101211210212012111100202 |
4 | 1221221210330030231 |
5 | 3324311223104013 |
6 | 124040330203245 |
7 | 11124105561035 |
oct | 1515144741455 |
9 | 354725174322 |
10 | 113440441133 |
11 | 44123198498 |
12 | 19b9ab83525 |
13 | a90b2122a6 |
14 | 56c20ba8c5 |
15 | 2e3e18c858 |
hex | 1a6993c32d |
113440441133 has 2 divisors, whose sum is σ = 113440441134. Its totient is φ = 113440441132.
The previous prime is 113440441123. The next prime is 113440441249. The reversal of 113440441133 is 331144044311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108901320004 + 4539121129 = 330002^2 + 67373^2 .
It is a cyclic number.
It is not a de Polignac number, because 113440441133 - 26 = 113440441069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113440441096 and 113440441105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113440441123) 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, 56720220566 + 56720220567.
It is an arithmetic number, because the mean of its divisors is an integer number (56720220567).
Almost surely, 2113440441133 is an apocalyptic number.
It is an amenable number.
113440441133 is a deficient number, since it is larger than the sum of its proper divisors (1).
113440441133 is an equidigital number, since it uses as much as digits as its factorization.
113440441133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 113440441133 its reverse (331144044311), we get a palindrome (444584485444).
The spelling of 113440441133 in words is "one hundred thirteen billion, four hundred forty million, four hundred forty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •