Base | Representation |
---|---|
bin | 110101101001101011… |
… | …0111001100010100101 |
3 | 102000101112121210120020 |
4 | 1223103112321202211 |
5 | 3341430034121000 |
6 | 124532404225353 |
7 | 11216065401123 |
oct | 1532326714245 |
9 | 360345553506 |
10 | 115215145125 |
11 | 44953a44903 |
12 | 1a3b539b259 |
13 | ab31ab64b2 |
14 | 580da8a913 |
15 | 2ee4d9aba0 |
hex | 1ad35b98a5 |
115215145125 has 16 divisors (see below), whose sum is σ = 191718002112. Its totient is φ = 61448077200.
The previous prime is 115215145121. The next prime is 115215145141. The reversal of 115215145125 is 521541512511.
It is a happy number.
It is not a de Polignac number, because 115215145125 - 22 = 115215145121 is a prime.
It is a super-2 number, since 2×1152151451252 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115215145121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 153619819 + ... + 153620568.
It is an arithmetic number, because the mean of its divisors is an integer number (11982375132).
Almost surely, 2115215145125 is an apocalyptic number.
115215145125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
115215145125 is a deficient number, since it is larger than the sum of its proper divisors (76502856987).
115215145125 is an equidigital number, since it uses as much as digits as its factorization.
115215145125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 307240405 (or 307240395 counting only the distinct ones).
The product of its digits is 10000, while the sum is 33.
Adding to 115215145125 its reverse (521541512511), we get a palindrome (636756657636).
The spelling of 115215145125 in words is "one hundred fifteen billion, two hundred fifteen million, one hundred forty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •