Base | Representation |
---|---|
bin | 110101110100000110… |
… | …0110101111111011001 |
3 | 102001021220121122222010 |
4 | 1223220030311333121 |
5 | 3343134044040211 |
6 | 125031215220133 |
7 | 11230542565416 |
oct | 1535014657731 |
9 | 361256548863 |
10 | 115564830681 |
11 | 45013374833 |
12 | 1a492517649 |
13 | ab8938c521 |
14 | 58442b510d |
15 | 30159214a6 |
hex | 1ae8335fd9 |
115564830681 has 8 divisors (see below), whose sum is σ = 156612448384. Its totient is φ = 75780216720.
The previous prime is 115564830649. The next prime is 115564830683. The reversal of 115564830681 is 186038465511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 115564830681 - 25 = 115564830649 is a prime.
It is a super-2 number, since 2×1155648306812 (a number of 23 digits) contains 22 as substring.
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 115564830681.
It is not an unprimeable number, because it can be changed into a prime (115564830683) 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, 315750721 + ... + 315751086.
It is an arithmetic number, because the mean of its divisors is an integer number (19576556048).
Almost surely, 2115564830681 is an apocalyptic number.
It is an amenable number.
115564830681 is a deficient number, since it is larger than the sum of its proper divisors (41047617703).
115564830681 is an equidigital number, since it uses as much as digits as its factorization.
115564830681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 631501871.
The product of its (nonzero) digits is 691200, while the sum is 48.
It can be divided in two parts, 115564830 and 681, that added together give a palindrome (115565511).
The spelling of 115564830681 in words is "one hundred fifteen billion, five hundred sixty-four million, eight hundred thirty thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •