Base | Representation |
---|---|
bin | 111101111111000011… |
… | …1100101110010011111 |
3 | 110201120211111122022111 |
4 | 1323332013211302133 |
5 | 4140103234442120 |
6 | 141052341054451 |
7 | 12421435625422 |
oct | 1737607456237 |
9 | 421524448274 |
10 | 133112421535 |
11 | 514a8545535 |
12 | 2196b0b7427 |
13 | c72495b692 |
14 | 662a9b79b9 |
15 | 36e121275a |
hex | 1efe1e5c9f |
133112421535 has 8 divisors (see below), whose sum is σ = 160145537760. Its totient is φ = 106216182624.
The previous prime is 133112421523. The next prime is 133112421539. The reversal of 133112421535 is 535124211331.
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 133112421535 - 211 = 133112419487 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133112421497 and 133112421506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133112421539) 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, 34217187 + ... + 34221076.
It is an arithmetic number, because the mean of its divisors is an integer number (20018192220).
Almost surely, 2133112421535 is an apocalyptic number.
133112421535 is a deficient number, since it is larger than the sum of its proper divisors (27033116225).
133112421535 is an equidigital number, since it uses as much as digits as its factorization.
133112421535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68438657.
The product of its digits is 10800, while the sum is 31.
Adding to 133112421535 its reverse (535124211331), we get a palindrome (668236632866).
The spelling of 133112421535 in words is "one hundred thirty-three billion, one hundred twelve million, four hundred twenty-one thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •