Base | Representation |
---|---|
bin | 11010001101000010100110… |
… | …010101100010101010101001 |
3 | 120010001100101210220101101101 |
4 | 122031002212111202222221 |
5 | 110101134440401314040 |
6 | 1045034552341521401 |
7 | 33163126166614330 |
oct | 3215024625425251 |
9 | 503040353811341 |
10 | 115245353151145 |
11 | 337a2309460648 |
12 | 10b133a3713261 |
13 | 4c3c7897b32a9 |
14 | 2065c94cc4d17 |
15 | d4cbe1d0409a |
hex | 68d0a6562aa9 |
115245353151145 has 16 divisors (see below), whose sum is σ = 160641766268928. Its totient is φ = 77729886901440.
The previous prime is 115245353151133. The next prime is 115245353151157. The reversal of 115245353151145 is 541151353542511.
It is an interprime number because it is at equal distance from previous prime (115245353151133) and next prime (115245353151157).
It is not a de Polignac number, because 115245353151145 - 25 = 115245353151113 is a prime.
It is a super-2 number, since 2×1152453531511452 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115245353151095 and 115245353151104.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26989541929 + ... + 26989546198.
It is an arithmetic number, because the mean of its divisors is an integer number (10040110391808).
Almost surely, 2115245353151145 is an apocalyptic number.
It is an amenable number.
115245353151145 is a deficient number, since it is larger than the sum of its proper divisors (45396413117783).
115245353151145 is an equidigital number, since it uses as much as digits as its factorization.
115245353151145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53979088200.
The product of its digits is 900000, while the sum is 46.
The spelling of 115245353151145 in words is "one hundred fifteen trillion, two hundred forty-five billion, three hundred fifty-three million, one hundred fifty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •