Base | Representation |
---|---|
bin | 111110000010011110… |
… | …1110110010101000001 |
3 | 110201212211200111101211 |
4 | 1330010331312111001 |
5 | 4140322142331403 |
6 | 141112003330121 |
7 | 12424332302416 |
oct | 1740475662501 |
9 | 421784614354 |
10 | 133227308353 |
11 | 51557384717 |
12 | 219a1680941 |
13 | c7426b5149 |
14 | 663bd6210d |
15 | 36eb35806d |
hex | 1f04f76541 |
133227308353 has 4 divisors (see below), whose sum is σ = 133428863188. Its totient is φ = 133025753520.
The previous prime is 133227308327. The next prime is 133227308399. The reversal of 133227308353 is 353803722331.
It is a happy number.
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 65519105089 + 67708203264 = 255967^2 + 260208^2 .
It is a cyclic number.
It is not a de Polignac number, because 133227308353 - 25 = 133227308321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133227303353) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 100776426 + ... + 100777747.
It is an arithmetic number, because the mean of its divisors is an integer number (33357215797).
Almost surely, 2133227308353 is an apocalyptic number.
It is an amenable number.
133227308353 is a deficient number, since it is larger than the sum of its proper divisors (201554835).
133227308353 is an equidigital number, since it uses as much as digits as its factorization.
133227308353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201554834.
The product of its (nonzero) digits is 272160, while the sum is 40.
The spelling of 133227308353 in words is "one hundred thirty-three billion, two hundred twenty-seven million, three hundred eight thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •