Base | Representation |
---|---|
bin | 1111110111111… |
… | …10001100010100 |
3 | 100021120022120121 |
4 | 13323332030110 |
5 | 233042133443 |
6 | 21114041324 |
7 | 3204566446 |
oct | 773761424 |
9 | 307508517 |
10 | 133161748 |
11 | 69191435 |
12 | 38719244 |
13 | 21784945 |
14 | 13984496 |
15 | ba554ed |
hex | 7efe314 |
133161748 has 24 divisors (see below), whose sum is σ = 248332392. Its totient is φ = 62260224.
The previous prime is 133161713. The next prime is 133161757. The reversal of 133161748 is 847161331.
133161748 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 34715664 + 98446084 = 5892^2 + 9922^2 .
It is a super-2 number, since 2×1331617482 = 35464102260831008, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 4440 + ... + 16912.
It is an arithmetic number, because the mean of its divisors is an integer number (10347183).
Almost surely, 2133161748 is an apocalyptic number.
It is an amenable number.
133161748 is a deficient number, since it is larger than the sum of its proper divisors (115170644).
133161748 is a wasteful number, since it uses less digits than its factorization.
133161748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12651 (or 12649 counting only the distinct ones).
The product of its digits is 12096, while the sum is 34.
The square root of 133161748 is about 11539.5731290200. The cubic root of 133161748 is about 510.6537150906.
The spelling of 133161748 in words is "one hundred thirty-three million, one hundred sixty-one thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •