Base | Representation |
---|---|
bin | 110110101111000001… |
… | …1101100000010110101 |
3 | 102020101201021111100121 |
4 | 1231132003230002311 |
5 | 3411211242022013 |
6 | 125555332011541 |
7 | 11330542503013 |
oct | 1553603540265 |
9 | 366351244317 |
10 | 117542142133 |
11 | 45938525129 |
12 | 1a944760bb1 |
13 | b112c217c0 |
14 | 5990b458b3 |
15 | 30ce30158d |
hex | 1b5e0ec0b5 |
117542142133 has 8 divisors (see below), whose sum is σ = 126722808576. Its totient is φ = 108381327600.
The previous prime is 117542142131. The next prime is 117542142139. The reversal of 117542142133 is 331241245711.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 117542142133 - 21 = 117542142131 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117542142131) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 4950673 + ... + 4974358.
It is an arithmetic number, because the mean of its divisors is an integer number (15840351072).
Almost surely, 2117542142133 is an apocalyptic number.
117542142133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
117542142133 is a deficient number, since it is larger than the sum of its proper divisors (9180666443).
117542142133 is an equidigital number, since it uses as much as digits as its factorization.
117542142133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9925955.
The product of its digits is 20160, while the sum is 34.
Adding to 117542142133 its reverse (331241245711), we get a palindrome (448783387844).
The spelling of 117542142133 in words is "one hundred seventeen billion, five hundred forty-two million, one hundred forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •