Base | Representation |
---|---|
bin | 110100101110110100… |
… | …1011110001101011111 |
3 | 101211021220121101200020 |
4 | 1221131221132031133 |
5 | 3323404004134211 |
6 | 124004420403223 |
7 | 11116125455214 |
oct | 1513551361537 |
9 | 354256541606 |
10 | 113240302431 |
11 | 44030220303 |
12 | 19b43b46513 |
13 | a8a8909b19 |
14 | 56a369db0b |
15 | 2e2b807306 |
hex | 1a5da5e35f |
113240302431 has 4 divisors (see below), whose sum is σ = 150987069912. Its totient is φ = 75493534952.
The previous prime is 113240302429. The next prime is 113240302447. The reversal of 113240302431 is 134203042311.
It is a happy number.
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 113240302431 - 21 = 113240302429 is a prime.
It is a super-2 number, since 2×1132403024312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113240302031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18873383736 + ... + 18873383741.
It is an arithmetic number, because the mean of its divisors is an integer number (37746767478).
Almost surely, 2113240302431 is an apocalyptic number.
113240302431 is a deficient number, since it is larger than the sum of its proper divisors (37746767481).
113240302431 is an equidigital number, since it uses as much as digits as its factorization.
113240302431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37746767480.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 113240302431 its reverse (134203042311), we get a palindrome (247443344742).
The spelling of 113240302431 in words is "one hundred thirteen billion, two hundred forty million, three hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •