Base | Representation |
---|---|
bin | 110101100100001011… |
… | …1111011011100011001 |
3 | 101222220200212102200221 |
4 | 1223020113323130121 |
5 | 3341040400200224 |
6 | 124502222400041 |
7 | 11211400140235 |
oct | 1531027733431 |
9 | 358820772627 |
10 | 115030865689 |
11 | 44869a19a53 |
12 | 1a363730021 |
13 | ab028747cc |
14 | 57d33db5c5 |
15 | 2ed3ae96e4 |
hex | 1ac85fb719 |
115030865689 has 8 divisors (see below), whose sum is σ = 115420091112. Its totient is φ = 114641779200.
The previous prime is 115030865683. The next prime is 115030865707. The reversal of 115030865689 is 986568030511.
It can be written as a sum of positive squares in 4 ways, for example, as 35394025689 + 79636840000 = 188133^2 + 282200^2 .
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 115030865689 - 23 = 115030865681 is a prime.
It is a super-3 number, since 3×1150308656893 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115030865681) 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, 1784037 + ... + 1847389.
It is an arithmetic number, because the mean of its divisors is an integer number (14427511389).
Almost surely, 2115030865689 is an apocalyptic number.
It is an amenable number.
115030865689 is a deficient number, since it is larger than the sum of its proper divisors (389225423).
115030865689 is an equidigital number, since it uses as much as digits as its factorization.
115030865689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69467.
The product of its (nonzero) digits is 1555200, while the sum is 52.
The spelling of 115030865689 in words is "one hundred fifteen billion, thirty million, eight hundred sixty-five thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •