Base | Representation |
---|---|
bin | 110100110100100110… |
… | …0110011100010110111 |
3 | 101211210102022001111001 |
4 | 1221221030303202313 |
5 | 3324303113123411 |
6 | 124035542424131 |
7 | 11124001030204 |
oct | 1515114634267 |
9 | 354712261431 |
10 | 113434114231 |
11 | 4411a666a49 |
12 | 19b98a32047 |
13 | a909b08569 |
14 | 56c1310cab |
15 | 2e3d83cdc1 |
hex | 1a693338b7 |
113434114231 has 4 divisors (see below), whose sum is σ = 114113360592. Its totient is φ = 112754867872.
The previous prime is 113434114159. The next prime is 113434114267. The reversal of 113434114231 is 132411434311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113434114231 - 27 = 113434114103 is a prime.
It is a super-2 number, since 2×1134341142312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113434114231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113434114531) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 339622930 + ... + 339623263.
It is an arithmetic number, because the mean of its divisors is an integer number (28528340148).
Almost surely, 2113434114231 is an apocalyptic number.
113434114231 is a deficient number, since it is larger than the sum of its proper divisors (679246361).
113434114231 is an equidigital number, since it uses as much as digits as its factorization.
113434114231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 679246360.
The product of its digits is 3456, while the sum is 28.
Adding to 113434114231 its reverse (132411434311), we get a palindrome (245845548542).
The spelling of 113434114231 in words is "one hundred thirteen billion, four hundred thirty-four million, one hundred fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •