Base | Representation |
---|---|
bin | 110100101110000101… |
… | …1000111100001110101 |
3 | 101211020012001202101210 |
4 | 1221130023013201311 |
5 | 3323331141133424 |
6 | 124002134312033 |
7 | 11115405310146 |
oct | 1513413074165 |
9 | 354205052353 |
10 | 113215567989 |
11 | 44018266a17 |
12 | 19b377b8619 |
13 | a8a3759764 |
14 | 56a02a1acd |
15 | 2e2956d729 |
hex | 1a5c2c7875 |
113215567989 has 4 divisors (see below), whose sum is σ = 150954090656. Its totient is φ = 75477045324.
The previous prime is 113215567963. The next prime is 113215568009. The reversal of 113215567989 is 989765512311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 113215567989 - 29 = 113215567477 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113215567889) 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 in 3 ways as a sum of consecutive naturals, for example, 18869261329 + ... + 18869261334.
It is an arithmetic number, because the mean of its divisors is an integer number (37738522664).
Almost surely, 2113215567989 is an apocalyptic number.
It is an amenable number.
113215567989 is a deficient number, since it is larger than the sum of its proper divisors (37738522667).
113215567989 is an equidigital number, since it uses as much as digits as its factorization.
113215567989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37738522666.
The product of its digits is 4082400, while the sum is 57.
The spelling of 113215567989 in words is "one hundred thirteen billion, two hundred fifteen million, five hundred sixty-seven thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •