Base | Representation |
---|---|
bin | 110101100011100101… |
… | …1000100000111100111 |
3 | 101222212021221201201011 |
4 | 1223013023010013213 |
5 | 3341020220404020 |
6 | 124500222443051 |
7 | 11211033646210 |
oct | 1530713040747 |
9 | 358767851634 |
10 | 115010716135 |
11 | 44859607327 |
12 | 1a358a33487 |
13 | aacb63b2b3 |
14 | 57d0874407 |
15 | 2ed1e6935a |
hex | 1ac72c41e7 |
115010716135 has 32 divisors (see below), whose sum is σ = 158163093504. Its totient is φ = 78647712000.
The previous prime is 115010716129. The next prime is 115010716147. The reversal of 115010716135 is 531617010511.
It is not a de Polignac number, because 115010716135 - 29 = 115010715623 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115010716097 and 115010716106.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 34116000 + ... + 34119370.
It is an arithmetic number, because the mean of its divisors is an integer number (4942596672).
Almost surely, 2115010716135 is an apocalyptic number.
115010716135 is a deficient number, since it is larger than the sum of its proper divisors (43152377369).
115010716135 is a wasteful number, since it uses less digits than its factorization.
115010716135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5775.
The product of its (nonzero) digits is 3150, while the sum is 31.
Adding to 115010716135 its reverse (531617010511), we get a palindrome (646627726646).
The spelling of 115010716135 in words is "one hundred fifteen billion, ten million, seven hundred sixteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •