Base | Representation |
---|---|
bin | 111110000100001011… |
… | …0100001000101101101 |
3 | 110202000210120010221210 |
4 | 1330020112201011231 |
5 | 4140431212402410 |
6 | 141121352545033 |
7 | 12425622133116 |
oct | 1741026410555 |
9 | 422023503853 |
10 | 133284106605 |
11 | 51586449021 |
12 | 219b86b2179 |
13 | c7513b0990 |
14 | 664570920d |
15 | 3701327220 |
hex | 1f085a116d |
133284106605 has 32 divisors (see below), whose sum is σ = 243168113664. Its totient is φ = 61756978176.
The previous prime is 133284106597. The next prime is 133284106607. The reversal of 133284106605 is 506601482331.
It is not a de Polignac number, because 133284106605 - 23 = 133284106597 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133284106607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20099869 + ... + 20106498.
It is an arithmetic number, because the mean of its divisors is an integer number (7599003552).
Almost surely, 2133284106605 is an apocalyptic number.
133284106605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
133284106605 is a deficient number, since it is larger than the sum of its proper divisors (109884007059).
133284106605 is a wasteful number, since it uses less digits than its factorization.
133284106605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40206405.
The product of its (nonzero) digits is 103680, while the sum is 39.
Adding to 133284106605 its reverse (506601482331), we get a palindrome (639885588936).
The spelling of 133284106605 in words is "one hundred thirty-three billion, two hundred eighty-four million, one hundred six thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •