Base | Representation |
---|---|
bin | 110100101000111011… |
… | …0101101000010010001 |
3 | 101210210010022011112020 |
4 | 1221101312231002101 |
5 | 3323002331210213 |
6 | 123533031522053 |
7 | 11111203631562 |
oct | 1512166550221 |
9 | 353703264466 |
10 | 113042444433 |
11 | 43a395706a6 |
12 | 19aa9829329 |
13 | a876922799 |
14 | 56852b8169 |
15 | 2e19272923 |
hex | 1a51dad091 |
113042444433 has 16 divisors (see below), whose sum is σ = 151106328576. Its totient is φ = 75170177280.
The previous prime is 113042444387. The next prime is 113042444461. The reversal of 113042444433 is 334444240311.
It is not a de Polignac number, because 113042444433 - 233 = 104452509841 is a prime.
It is a super-3 number, since 3×1130424444333 (a number of 34 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 113042444394 and 113042444403.
It is not an unprimeable number, because it can be changed into a prime (113042444533) 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 in 15 ways as a sum of consecutive naturals, for example, 8139091 + ... + 8152967.
It is an arithmetic number, because the mean of its divisors is an integer number (9444145536).
Almost surely, 2113042444433 is an apocalyptic number.
It is an amenable number.
113042444433 is a deficient number, since it is larger than the sum of its proper divisors (38063884143).
113042444433 is a wasteful number, since it uses less digits than its factorization.
113042444433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20584.
The product of its (nonzero) digits is 55296, while the sum is 33.
Adding to 113042444433 its reverse (334444240311), we get a palindrome (447486684744).
The spelling of 113042444433 in words is "one hundred thirteen billion, forty-two million, four hundred forty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •