Base | Representation |
---|---|
bin | 110101110000000000… |
… | …0000001010000111101 |
3 | 102000221022201220111001 |
4 | 1223200000001100331 |
5 | 3342343334020021 |
6 | 125005422330301 |
7 | 11224252306300 |
oct | 1534000012075 |
9 | 360838656431 |
10 | 115427251261 |
11 | 44a52746333 |
12 | 1a454429991 |
13 | ab66a1bb9a |
14 | 582dd00b37 |
15 | 30087e7091 |
hex | 1ae000143d |
115427251261 has 12 divisors (see below), whose sum is σ = 137129381568. Its totient is φ = 96832585752.
The previous prime is 115427251237. The next prime is 115427251267. The reversal of 115427251261 is 162152724511.
It is a happy number.
It is not a de Polignac number, because 115427251261 - 215 = 115427218493 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 115427251261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115427251267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25057891 + ... + 25062496.
It is an arithmetic number, because the mean of its divisors is an integer number (11427448464).
Almost surely, 2115427251261 is an apocalyptic number.
It is an amenable number.
115427251261 is a deficient number, since it is larger than the sum of its proper divisors (21702130307).
115427251261 is an equidigital number, since it uses as much as digits as its factorization.
115427251261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50120448 (or 50120441 counting only the distinct ones).
The product of its digits is 33600, while the sum is 37.
Adding to 115427251261 its reverse (162152724511), we get a palindrome (277579975772).
The spelling of 115427251261 in words is "one hundred fifteen billion, four hundred twenty-seven million, two hundred fifty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •