Base | Representation |
---|---|
bin | 110100101011000000… |
… | …0111011000100010111 |
3 | 101210221222121202100220 |
4 | 1221112000323010113 |
5 | 3323123212412330 |
6 | 123544003405423 |
7 | 11113012052523 |
oct | 1512600730427 |
9 | 353858552326 |
10 | 113112232215 |
11 | 43a749a7254 |
12 | 19b09083873 |
13 | a888218828 |
14 | 5690682d83 |
15 | 2e2045a710 |
hex | 1a5603b117 |
113112232215 has 16 divisors (see below), whose sum is σ = 181072476000. Its totient is φ = 60295555712.
The previous prime is 113112232213. The next prime is 113112232237. The reversal of 113112232215 is 512232211311.
It is a cyclic number.
It is not a de Polignac number, because 113112232215 - 21 = 113112232213 is a prime.
It is a super-3 number, since 3×1131122322153 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113112232213) 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, 1905300 + ... + 1963769.
It is an arithmetic number, because the mean of its divisors is an integer number (11317029750).
Almost surely, 2113112232215 is an apocalyptic number.
113112232215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
113112232215 is a deficient number, since it is larger than the sum of its proper divisors (67960243785).
113112232215 is a wasteful number, since it uses less digits than its factorization.
113112232215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3871026.
The product of its digits is 720, while the sum is 24.
Adding to 113112232215 its reverse (512232211311), we get a palindrome (625344443526).
The spelling of 113112232215 in words is "one hundred thirteen billion, one hundred twelve million, two hundred thirty-two thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •