Base | Representation |
---|---|
bin | 110101101010001101… |
… | …1111110111001110111 |
3 | 102000102210200212200111 |
4 | 1223110123332321313 |
5 | 3341444203130111 |
6 | 124534252323451 |
7 | 11216405335516 |
oct | 1532433767167 |
9 | 360383625614 |
10 | 115233255031 |
11 | 44963194074 |
12 | 1a3bb473587 |
13 | ab3578750b |
14 | 581224267d |
15 | 2ee6776a21 |
hex | 1ad46fee77 |
115233255031 has 8 divisors (see below), whose sum is σ = 115339898880. Its totient is φ = 115126650072.
The previous prime is 115233255019. The next prime is 115233255037. The reversal of 115233255031 is 130552332511.
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 115233255031 - 211 = 115233252983 is a prime.
It is a super-2 number, since 2×1152332550312 (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 = 115233254984 and 115233255002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115233255037) 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, 12151950 + ... + 12161428.
It is an arithmetic number, because the mean of its divisors is an integer number (14417487360).
Almost surely, 2115233255031 is an apocalyptic number.
115233255031 is a deficient number, since it is larger than the sum of its proper divisors (106643849).
115233255031 is an equidigital number, since it uses as much as digits as its factorization.
115233255031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19445.
The product of its (nonzero) digits is 13500, while the sum is 31.
Adding to 115233255031 its reverse (130552332511), we get a palindrome (245785587542).
The spelling of 115233255031 in words is "one hundred fifteen billion, two hundred thirty-three million, two hundred fifty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •