Base | Representation |
---|---|
bin | 11010001011101100111101… |
… | …101100011111001001001101 |
3 | 120002201120001122221012001212 |
4 | 122023230331230133021031 |
5 | 110043133132212321013 |
6 | 1044524424304144205 |
7 | 33153362452404521 |
oct | 3213547554371115 |
9 | 502646048835055 |
10 | 115153403245133 |
11 | 337673140a8290 |
12 | 10ab9601908065 |
13 | 4c33bc4a05a96 |
14 | 206165104bd81 |
15 | d4a60e6ac6a8 |
hex | 68bb3db1f24d |
115153403245133 has 8 divisors (see below), whose sum is σ = 125994659718720. Its totient is φ = 104374274316480.
The previous prime is 115153403245117. The next prime is 115153403245147. The reversal of 115153403245133 is 331542304351511.
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 115153403245133 - 24 = 115153403245117 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 (115153403245163) 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, 15531882353 + ... + 15531889766.
It is an arithmetic number, because the mean of its divisors is an integer number (15749332464840).
Almost surely, 2115153403245133 is an apocalyptic number.
It is an amenable number.
115153403245133 is a deficient number, since it is larger than the sum of its proper divisors (10841256473587).
115153403245133 is a wasteful number, since it uses less digits than its factorization.
115153403245133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31063772467.
The product of its (nonzero) digits is 324000, while the sum is 41.
Adding to 115153403245133 its reverse (331542304351511), we get a palindrome (446695707596644).
The spelling of 115153403245133 in words is "one hundred fifteen trillion, one hundred fifty-three billion, four hundred three million, two hundred forty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •