Base | Representation |
---|---|
bin | 110101100100111000… |
… | …1000110100101011101 |
3 | 101222222022212002011110 |
4 | 1223021301012211131 |
5 | 3341112341222031 |
6 | 124504415412233 |
7 | 11212102631166 |
oct | 1531161064535 |
9 | 358868762143 |
10 | 115054242141 |
11 | 44881136033 |
12 | 1a36b524079 |
13 | ab0766aa27 |
14 | 57d656476d |
15 | 2ed5bb5c46 |
hex | 1ac9c4695d |
115054242141 has 8 divisors (see below), whose sum is σ = 153409840384. Its totient is φ = 76700736000.
The previous prime is 115054242139. The next prime is 115054242161. The reversal of 115054242141 is 141242450511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 115054242141 - 21 = 115054242139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115054242099 and 115054242108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115054242161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 389860 + ... + 618141.
It is an arithmetic number, because the mean of its divisors is an integer number (19176230048).
Almost surely, 2115054242141 is an apocalyptic number.
It is an amenable number.
115054242141 is a deficient number, since it is larger than the sum of its proper divisors (38355598243).
115054242141 is a wasteful number, since it uses less digits than its factorization.
115054242141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1046051.
The product of its (nonzero) digits is 6400, while the sum is 30.
Adding to 115054242141 its reverse (141242450511), we get a palindrome (256296692652).
The spelling of 115054242141 in words is "one hundred fifteen billion, fifty-four million, two hundred forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •