Base | Representation |
---|---|
bin | 11010001100110101100001… |
… | …010111001001001000011101 |
3 | 120010000000011012012021121211 |
4 | 122030311201113021020131 |
5 | 110100422211111303203 |
6 | 1045024311122424421 |
7 | 33162121210632004 |
oct | 3214654127111035 |
9 | 503000135167554 |
10 | 115231311041053 |
11 | 33797363010489 |
12 | 10b10724b02111 |
13 | 4c3b35c54c2cc |
14 | 2065321da9c3b |
15 | d4c66e153c6d |
hex | 68cd615c921d |
115231311041053 has 8 divisors (see below), whose sum is σ = 115527965660640. Its totient is φ = 114934658628240.
The previous prime is 115231311040999. The next prime is 115231311041089. The reversal of 115231311041053 is 350140113132511.
It is a happy number.
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 115231311041053 - 213 = 115231311032861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115231311047053) 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, 179579398 + ... + 180219928.
It is an arithmetic number, because the mean of its divisors is an integer number (14440995707580).
Almost surely, 2115231311041053 is an apocalyptic number.
It is an amenable number.
115231311041053 is a deficient number, since it is larger than the sum of its proper divisors (296654619587).
115231311041053 is an equidigital number, since it uses as much as digits as its factorization.
115231311041053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1103387.
The product of its (nonzero) digits is 5400, while the sum is 31.
Adding to 115231311041053 its reverse (350140113132511), we get a palindrome (465371424173564).
The spelling of 115231311041053 in words is "one hundred fifteen trillion, two hundred thirty-one billion, three hundred eleven million, forty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •