Base | Representation |
---|---|
bin | 110101100110111111… |
… | …1111000001111101111 |
3 | 102000011021102100120011 |
4 | 1223031333320033233 |
5 | 3341234024140211 |
6 | 124515433034051 |
7 | 11213624155510 |
oct | 1531577701757 |
9 | 360137370504 |
10 | 115125224431 |
11 | 44908208088 |
12 | 1a38b255927 |
13 | ab19291699 |
14 | 5801b60a07 |
15 | 2edc037921 |
hex | 1acdff83ef |
115125224431 has 8 divisors (see below), whose sum is σ = 131574906144. Its totient is φ = 98676348000.
The previous prime is 115125224419. The next prime is 115125224447. The reversal of 115125224431 is 134422521511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 115125224431 - 211 = 115125222383 is a prime.
It is a super-2 number, since 2×1151252244312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115125224393 and 115125224402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115125224531) 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, 144681 + ... + 501181.
It is an arithmetic number, because the mean of its divisors is an integer number (16446863268).
Almost surely, 2115125224431 is an apocalyptic number.
115125224431 is a deficient number, since it is larger than the sum of its proper divisors (16449681713).
115125224431 is an equidigital number, since it uses as much as digits as its factorization.
115125224431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 402641.
The product of its digits is 9600, while the sum is 31.
Adding to 115125224431 its reverse (134422521511), we get a palindrome (249547745942).
The spelling of 115125224431 in words is "one hundred fifteen billion, one hundred twenty-five million, two hundred twenty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •