Base | Representation |
---|---|
bin | 110101100100001011… |
… | …0101111001000110101 |
3 | 101222220200021112222002 |
4 | 1223020112233020311 |
5 | 3341040310200031 |
6 | 124502211545045 |
7 | 11211364366100 |
oct | 1531026571065 |
9 | 358820245862 |
10 | 115030553141 |
11 | 44869826149 |
12 | 1a3635bb185 |
13 | ab0279547a |
14 | 57d3359737 |
15 | 2ed3a86ccb |
hex | 1ac85af235 |
115030553141 has 24 divisors (see below), whose sum is σ = 140940334080. Its totient is φ = 93350843712.
The previous prime is 115030553137. The next prime is 115030553173. The reversal of 115030553141 is 141355030511.
It is not a de Polignac number, because 115030553141 - 22 = 115030553137 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115030553111) 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 23 ways as a sum of consecutive naturals, for example, 1511105 + ... + 1585401.
It is an arithmetic number, because the mean of its divisors is an integer number (5872513920).
Almost surely, 2115030553141 is an apocalyptic number.
It is an amenable number.
115030553141 is a deficient number, since it is larger than the sum of its proper divisors (25909780939).
115030553141 is a wasteful number, since it uses less digits than its factorization.
115030553141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75993 (or 75986 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 115030553141 its reverse (141355030511), we get a palindrome (256385583652).
The spelling of 115030553141 in words is "one hundred fifteen billion, thirty million, five hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.565 sec. • engine limits •