Base | Representation |
---|---|
bin | 110101100100011111… |
… | …0110101000011100001 |
3 | 101222221102001111222012 |
4 | 1223020332311003201 |
5 | 3341101003010022 |
6 | 124503225122305 |
7 | 11211552621350 |
oct | 1531076650341 |
9 | 358842044865 |
10 | 115041063137 |
11 | 448747544a0 |
12 | 1a367029395 |
13 | ab04a051c0 |
14 | 57d48d3997 |
15 | 2ed4960de2 |
hex | 1ac8fb50e1 |
115041063137 has 64 divisors (see below), whose sum is σ = 163956441600. Its totient is φ = 77684244480.
The previous prime is 115041063107. The next prime is 115041063157. The reversal of 115041063137 is 731360140511.
It is not a de Polignac number, because 115041063137 - 216 = 115040997601 is a prime.
It is not an unprimeable number, because it can be changed into a prime (115041063107) 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 63 ways as a sum of consecutive naturals, for example, 6951689 + ... + 6968217.
It is an arithmetic number, because the mean of its divisors is an integer number (2561819400).
Almost surely, 2115041063137 is an apocalyptic number.
115041063137 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
115041063137 is a deficient number, since it is larger than the sum of its proper divisors (48915378463).
115041063137 is a wasteful number, since it uses less digits than its factorization.
115041063137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16986.
The product of its (nonzero) digits is 7560, while the sum is 32.
The spelling of 115041063137 in words is "one hundred fifteen billion, forty-one million, sixty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •