Base | Representation |
---|---|
bin | 110101110011011001… |
… | …0001000101010001101 |
3 | 102001020020212120210220 |
4 | 1223212302020222031 |
5 | 3343112002131140 |
6 | 125025005421553 |
7 | 11230133511066 |
oct | 1534662105215 |
9 | 361206776726 |
10 | 115541052045 |
11 | 45000a03571 |
12 | 1a48656a8b9 |
13 | ab84485223 |
14 | 584108556d |
15 | 30137c5bd0 |
hex | 1ae6c88a8d |
115541052045 has 8 divisors (see below), whose sum is σ = 184865683296. Its totient is φ = 61621894416.
The previous prime is 115541052043. The next prime is 115541052049. The reversal of 115541052045 is 540250145511.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 115541052045 - 21 = 115541052043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115541051997 and 115541052015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115541052043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3851368387 + ... + 3851368416.
It is an arithmetic number, because the mean of its divisors is an integer number (23108210412).
Almost surely, 2115541052045 is an apocalyptic number.
115541052045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
115541052045 is a deficient number, since it is larger than the sum of its proper divisors (69324631251).
115541052045 is an equidigital number, since it uses as much as digits as its factorization.
115541052045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7702736811.
The product of its (nonzero) digits is 20000, while the sum is 33.
Adding to 115541052045 its reverse (540250145511), we get a palindrome (655791197556).
The spelling of 115541052045 in words is "one hundred fifteen billion, five hundred forty-one million, fifty-two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •