Base | Representation |
---|---|
bin | 1111110111011… |
… | …11001111100010 |
3 | 100021110012120200 |
4 | 13323233033202 |
5 | 233033204024 |
6 | 21112450030 |
7 | 3204223101 |
oct | 773571742 |
9 | 307405520 |
10 | 133100514 |
11 | 6914a428 |
12 | 386a9916 |
13 | 21762b01 |
14 | 1396a038 |
15 | ba422c9 |
hex | 7eef3e2 |
133100514 has 72 divisors (see below), whose sum is σ = 315862092. Its totient is φ = 40343040.
The previous prime is 133100501. The next prime is 133100521. The reversal of 133100514 is 415001331.
It can be written as a sum of positive squares in 2 ways, for example, as 130713489 + 2387025 = 11433^2 + 1545^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 1292187 + ... + 1292289.
Almost surely, 2133100514 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 133100514, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157931046).
133100514 is an abundant number, since it is smaller than the sum of its proper divisors (182761578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133100514 is a wasteful number, since it uses less digits than its factorization.
133100514 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272 (or 166 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 133100514 is about 11536.9196062034. The cubic root of 133100514 is about 510.5754289353.
Adding to 133100514 its reverse (415001331), we get a palindrome (548101845).
The spelling of 133100514 in words is "one hundred thirty-three million, one hundred thousand, five hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •