Base | Representation |
---|---|
bin | 110100101011010101… |
… | …0110011111110101111 |
3 | 101210222202021122111012 |
4 | 1221112222303332233 |
5 | 3323134020310411 |
6 | 123545035015435 |
7 | 11113204306250 |
oct | 1512652637657 |
9 | 353882248435 |
10 | 113123213231 |
11 | 43a80117476 |
12 | 19b1089a57b |
13 | a88a591a82 |
14 | 5691d00b27 |
15 | 2e213c918b |
hex | 1a56ab3faf |
113123213231 has 4 divisors (see below), whose sum is σ = 129283672272. Its totient is φ = 96962754192.
The previous prime is 113123213183. The next prime is 113123213233. The reversal of 113123213231 is 132312321311.
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 113123213231 - 26 = 113123213167 is a prime.
It is a super-2 number, since 2×1131232132312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113123213197 and 113123213206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113123213233) 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, 8080229510 + ... + 8080229523.
It is an arithmetic number, because the mean of its divisors is an integer number (32320918068).
Almost surely, 2113123213231 is an apocalyptic number.
113123213231 is a deficient number, since it is larger than the sum of its proper divisors (16160459041).
113123213231 is an equidigital number, since it uses as much as digits as its factorization.
113123213231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16160459040.
The product of its digits is 648, while the sum is 23.
Adding to 113123213231 its reverse (132312321311), we get a palindrome (245435534542).
The spelling of 113123213231 in words is "one hundred thirteen billion, one hundred twenty-three million, two hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •