Base | Representation |
---|---|
bin | 110101100100010001… |
… | …0000001110010100101 |
3 | 101222220212211221022010 |
4 | 1223020202001302211 |
5 | 3341042034410000 |
6 | 124502355224433 |
7 | 11211431504556 |
oct | 1531042016245 |
9 | 358825757263 |
10 | 115033513125 |
11 | 44870468013 |
12 | 1a3645a8119 |
13 | ab0329083b |
14 | 57d38ca32d |
15 | 2ed3e6dd50 |
hex | 1ac8881ca5 |
115033513125 has 20 divisors (see below), whose sum is σ = 191661173792. Its totient is φ = 61351206000.
The previous prime is 115033513121. The next prime is 115033513193. The reversal of 115033513125 is 521315330511.
It is not a de Polignac number, because 115033513125 - 22 = 115033513121 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 115033513092 and 115033513101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115033513121) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 30673729 + ... + 30677478.
Almost surely, 2115033513125 is an apocalyptic number.
115033513125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
115033513125 is a deficient number, since it is larger than the sum of its proper divisors (76627660667).
115033513125 is an frugal number, since it uses more digits than its factorization.
115033513125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61351230 (or 61351215 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 30.
Adding to 115033513125 its reverse (521315330511), we get a palindrome (636348843636).
The spelling of 115033513125 in words is "one hundred fifteen billion, thirty-three million, five hundred thirteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •