Base | Representation |
---|---|
bin | 110100101111001011… |
… | …1101111100110110001 |
3 | 101211022202102122201211 |
4 | 1221132113233212301 |
5 | 3323420110313210 |
6 | 124005532400121 |
7 | 11116333535245 |
oct | 1513627574661 |
9 | 354282378654 |
10 | 113252432305 |
11 | 440370556a1 |
12 | 19b48016041 |
13 | a8ab295c6c |
14 | 56a513a425 |
15 | 2e2c90138a |
hex | 1a5e5ef9b1 |
113252432305 has 12 divisors (see below), whose sum is σ = 136469521116. Its totient is φ = 90225772800.
The previous prime is 113252432299. The next prime is 113252432357. The reversal of 113252432305 is 503234252311.
It can be written as a sum of positive squares in 6 ways, for example, as 2394732096 + 110857700209 = 48936^2 + 332953^2 .
It is not a de Polignac number, because 113252432305 - 25 = 113252432273 is a prime.
It is a super-2 number, since 2×1132524323052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 95415 + ... + 485395.
It is an arithmetic number, because the mean of its divisors is an integer number (11372460093).
Almost surely, 2113252432305 is an apocalyptic number.
It is an amenable number.
113252432305 is a deficient number, since it is larger than the sum of its proper divisors (23217088811).
113252432305 is an frugal number, since it uses more digits than its factorization.
113252432305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 390468 (or 390227 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 113252432305 its reverse (503234252311), we get a palindrome (616486684616).
The spelling of 113252432305 in words is "one hundred thirteen billion, two hundred fifty-two million, four hundred thirty-two thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •