Base | Representation |
---|---|
bin | 110101100100110011… |
… | …0000000001110100001 |
3 | 101222222010101020220110 |
4 | 1223021212000032201 |
5 | 3341111120120023 |
6 | 124504233201533 |
7 | 11212036122255 |
oct | 1531146001641 |
9 | 358863336813 |
10 | 115051332513 |
11 | 4487a528a87 |
12 | 1a36a5602a9 |
13 | ab06b8c560 |
14 | 57d6008265 |
15 | 2ed57dda93 |
hex | 1ac99803a1 |
115051332513 has 32 divisors (see below), whose sum is σ = 168121820160. Its totient is φ = 69556495680.
The previous prime is 115051332503. The next prime is 115051332589. The reversal of 115051332513 is 315233150511.
It is not a de Polignac number, because 115051332513 - 218 = 115051070369 is a prime.
It is a super-2 number, since 2×1150513325132 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (115051332503) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 710218 + ... + 857036.
It is an arithmetic number, because the mean of its divisors is an integer number (5253806880).
Almost surely, 2115051332513 is an apocalyptic number.
115051332513 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
115051332513 is a deficient number, since it is larger than the sum of its proper divisors (53070487647).
115051332513 is a wasteful number, since it uses less digits than its factorization.
115051332513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147189.
The product of its (nonzero) digits is 6750, while the sum is 30.
The spelling of 115051332513 in words is "one hundred fifteen billion, fifty-one million, three hundred thirty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •