Base | Representation |
---|---|
bin | 110100101110000100… |
… | …1001111001100110110 |
3 | 101211020011010201022121 |
4 | 1221130021033030312 |
5 | 3323331024401001 |
6 | 124002115550154 |
7 | 11115401155216 |
oct | 1513411171466 |
9 | 354204121277 |
10 | 113215075126 |
11 | 44017a5a69a |
12 | 19b375bb35a |
13 | a8a361631a |
14 | 56a01b4246 |
15 | 2e294c26a1 |
hex | 1a5c24f336 |
113215075126 has 8 divisors (see below), whose sum is σ = 171380618640. Its totient is φ = 56088202248.
The previous prime is 113215075123. The next prime is 113215075153. The reversal of 113215075126 is 621570512311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 113215075091 and 113215075100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113215075121) 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, 259667386 + ... + 259667821.
It is an arithmetic number, because the mean of its divisors is an integer number (21422577330).
Almost surely, 2113215075126 is an apocalyptic number.
113215075126 is a deficient number, since it is larger than the sum of its proper divisors (58165543514).
113215075126 is a wasteful number, since it uses less digits than its factorization.
113215075126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519335318.
The product of its (nonzero) digits is 12600, while the sum is 34.
Adding to 113215075126 its reverse (621570512311), we get a palindrome (734785587437).
The spelling of 113215075126 in words is "one hundred thirteen billion, two hundred fifteen million, seventy-five thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •