Base | Representation |
---|---|
bin | 11010001011101100111001… |
… | …100101011111100101000111 |
3 | 120002201112212212012120022021 |
4 | 122023230321211133211013 |
5 | 110043133012040144142 |
6 | 1044524413402344011 |
7 | 33153360654405265 |
oct | 3213547145374507 |
9 | 502645785176267 |
10 | 115153334303047 |
11 | 3376728919a057 |
12 | 10ab95a27bb007 |
13 | 4c33bb3647951 |
14 | 2061645c23435 |
15 | d4a6085e0267 |
hex | 68bb3995f947 |
115153334303047 has 2 divisors, whose sum is σ = 115153334303048. Its totient is φ = 115153334303046.
The previous prime is 115153334303023. The next prime is 115153334303087. The reversal of 115153334303047 is 740303433351511.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 115153334303047 - 215 = 115153334270279 is a prime.
It is a super-2 number, since 2×1151533343030472 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115153334302994 and 115153334303012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115153334303087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57576667151523 + 57576667151524.
It is an arithmetic number, because the mean of its divisors is an integer number (57576667151524).
Almost surely, 2115153334303047 is an apocalyptic number.
115153334303047 is a deficient number, since it is larger than the sum of its proper divisors (1).
115153334303047 is an equidigital number, since it uses as much as digits as its factorization.
115153334303047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 680400, while the sum is 43.
Adding to 115153334303047 its reverse (740303433351511), we get a palindrome (855456767654558).
The spelling of 115153334303047 in words is "one hundred fifteen trillion, one hundred fifty-three billion, three hundred thirty-four million, three hundred three thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •