Base | Representation |
---|---|
bin | 111110000101010010… |
… | …0000001000111100111 |
3 | 110202010101100200200001 |
4 | 1330022210001013213 |
5 | 4141020211400403 |
6 | 141125200002131 |
7 | 12426552334330 |
oct | 1741244010747 |
9 | 422111320601 |
10 | 133321200103 |
11 | 515a5383a03 |
12 | 21a09000347 |
13 | c758c9a5b0 |
14 | 664a603287 |
15 | 3704702c1d |
hex | 1f0a9011e7 |
133321200103 has 8 divisors (see below), whose sum is σ = 164087631008. Its totient is φ = 105484905504.
The previous prime is 133321200059. The next prime is 133321200121. The reversal of 133321200103 is 301002123331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133321200103 - 229 = 132784329191 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133321204103) 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 7 ways as a sum of consecutive naturals, for example, 732533976 + ... + 732534157.
It is an arithmetic number, because the mean of its divisors is an integer number (20510953876).
Almost surely, 2133321200103 is an apocalyptic number.
133321200103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
133321200103 is a deficient number, since it is larger than the sum of its proper divisors (30766430905).
133321200103 is a wasteful number, since it uses less digits than its factorization.
133321200103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1465068153.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 133321200103 its reverse (301002123331), we get a palindrome (434323323434).
The spelling of 133321200103 in words is "one hundred thirty-three billion, three hundred twenty-one million, two hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •