Base | Representation |
---|---|
bin | 111110101001011010… |
… | …0100100110110101101 |
3 | 110212020212111220221120 |
4 | 1331102310210312231 |
5 | 4201011034002313 |
6 | 141445343451153 |
7 | 12501602612331 |
oct | 1752264446655 |
9 | 425225456846 |
10 | 134533500333 |
11 | 52067721021 |
12 | 220a6bb6ab9 |
13 | c8c01aa5cb |
14 | 67236157c1 |
15 | 3775d6cd23 |
hex | 1f52d24dad |
134533500333 has 8 divisors (see below), whose sum is σ = 179446449696. Its totient is φ = 89654775600.
The previous prime is 134533500319. The next prime is 134533500337. The reversal of 134533500333 is 333005335431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 134533500333 - 28 = 134533500077 is a prime.
It is a super-2 number, since 2×1345335003332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134533500294 and 134533500303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134533500337) 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, 8546983 + ... + 8562708.
It is an arithmetic number, because the mean of its divisors is an integer number (22430806212).
Almost surely, 2134533500333 is an apocalyptic number.
It is an amenable number.
134533500333 is a deficient number, since it is larger than the sum of its proper divisors (44912949363).
134533500333 is a wasteful number, since it uses less digits than its factorization.
134533500333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17112315.
The product of its (nonzero) digits is 72900, while the sum is 33.
Adding to 134533500333 its reverse (333005335431), we get a palindrome (467538835764).
The spelling of 134533500333 in words is "one hundred thirty-four billion, five hundred thirty-three million, five hundred thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •