Base | Representation |
---|---|
bin | 11010001110011111011100… |
… | …001010101011111100100101 |
3 | 120010101212201012021120111120 |
4 | 122032133130022223330211 |
5 | 110104303120333214140 |
6 | 1045152440300124153 |
7 | 33203255426366544 |
oct | 3216373412537445 |
9 | 503355635246446 |
10 | 115345040523045 |
11 | 33830614377613 |
12 | 10b2a784836659 |
13 | 4c48cb55c3098 |
14 | 206aa3060615b |
15 | d505c88881d0 |
hex | 68e7dc2abf25 |
115345040523045 has 8 divisors (see below), whose sum is σ = 184552064836896. Its totient is φ = 61517354945616.
The previous prime is 115345040522981. The next prime is 115345040523073. The reversal of 115345040523045 is 540325040543511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 115345040523045 - 26 = 115345040522981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115345040522988 and 115345040523006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3844834684087 + ... + 3844834684116.
It is an arithmetic number, because the mean of its divisors is an integer number (23069008104612).
Almost surely, 2115345040523045 is an apocalyptic number.
115345040523045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
115345040523045 is a deficient number, since it is larger than the sum of its proper divisors (69207024313851).
115345040523045 is an equidigital number, since it uses as much as digits as its factorization.
115345040523045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7689669368211.
The product of its (nonzero) digits is 720000, while the sum is 42.
The spelling of 115345040523045 in words is "one hundred fifteen trillion, three hundred forty-five billion, forty million, five hundred twenty-three thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •