Base | Representation |
---|---|
bin | 11010001110101001001110… |
… | …101010111011101000111001 |
3 | 120010102212211201120012021012 |
4 | 122032221032222323220321 |
5 | 110104441132141410040 |
6 | 1045201335255123305 |
7 | 33204110050340546 |
oct | 3216511652735071 |
9 | 503385751505235 |
10 | 115355551513145 |
11 | 33835018574a99 |
12 | 10b30818973535 |
13 | 4c49c9c112a58 |
14 | 206b34a581bcd |
15 | d509e1530865 |
hex | 68ea4eabba39 |
115355551513145 has 4 divisors (see below), whose sum is σ = 138426661815780. Its totient is φ = 92284441210512.
The previous prime is 115355551513129. The next prime is 115355551513151. The reversal of 115355551513145 is 541315155553511.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17155062245689 + 98200489267456 = 4141867^2 + 9909616^2 .
It is a cyclic number.
It is not a de Polignac number, because 115355551513145 - 24 = 115355551513129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115355551513093 and 115355551513102.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11535555151310 + ... + 11535555151319.
It is an arithmetic number, because the mean of its divisors is an integer number (34606665453945).
Almost surely, 2115355551513145 is an apocalyptic number.
It is an amenable number.
115355551513145 is a deficient number, since it is larger than the sum of its proper divisors (23071110302635).
115355551513145 is an equidigital number, since it uses as much as digits as its factorization.
115355551513145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23071110302634.
The product of its digits is 2812500, while the sum is 50.
The spelling of 115355551513145 in words is "one hundred fifteen trillion, three hundred fifty-five billion, five hundred fifty-one million, five hundred thirteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •