Base | Representation |
---|---|
bin | 1111110111011… |
… | …11011101111001 |
3 | 100021110020211201 |
4 | 13323233131321 |
5 | 233033221213 |
6 | 21112454201 |
7 | 3204225553 |
oct | 773573571 |
9 | 307406751 |
10 | 133101433 |
11 | 69150093 |
12 | 386aa361 |
13 | 2176335a |
14 | 1396a4d3 |
15 | ba426dd |
hex | 7eef779 |
133101433 has 4 divisors (see below), whose sum is σ = 133357428. Its totient is φ = 132845440.
The previous prime is 133101431. The next prime is 133101439. The reversal of 133101433 is 334101331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79709184 + 53392249 = 8928^2 + 7307^2 .
It is a cyclic number.
It is not a de Polignac number, because 133101433 - 21 = 133101431 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133101433.
It is not an unprimeable number, because it can be changed into a prime (133101431) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 127216 + ... + 128257.
It is an arithmetic number, because the mean of its divisors is an integer number (33339357).
Almost surely, 2133101433 is an apocalyptic number.
It is an amenable number.
133101433 is a deficient number, since it is larger than the sum of its proper divisors (255995).
133101433 is an equidigital number, since it uses as much as digits as its factorization.
133101433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255994.
The product of its (nonzero) digits is 324, while the sum is 19.
The square root of 133101433 is about 11536.9594347904. The cubic root of 133101433 is about 510.5766040315.
Adding to 133101433 its reverse (334101331), we get a palindrome (467202764).
The spelling of 133101433 in words is "one hundred thirty-three million, one hundred one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •