Base | Representation |
---|---|
bin | 111110000100101001… |
… | …1001100010010101001 |
3 | 110202001220111020022221 |
4 | 1330021103030102221 |
5 | 4140444300342301 |
6 | 141123121514041 |
7 | 12426204260116 |
oct | 1741123142251 |
9 | 422056436287 |
10 | 133300012201 |
11 | 51594422144 |
12 | 21a01aa2921 |
13 | c75478c585 |
14 | 664788990d |
15 | 3702919da1 |
hex | 1f094cc4a9 |
133300012201 has 4 divisors (see below), whose sum is σ = 134619814404. Its totient is φ = 131980210000.
The previous prime is 133300012189. The next prime is 133300012229. The reversal of 133300012201 is 102210003331.
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 99111632400 + 34188379801 = 314820^2 + 184901^2 .
It is a cyclic number.
It is not a de Polignac number, because 133300012201 - 217 = 133299881129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133300012271) 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 3 ways as a sum of consecutive naturals, for example, 659900950 + ... + 659901151.
It is an arithmetic number, because the mean of its divisors is an integer number (33654953601).
Almost surely, 2133300012201 is an apocalyptic number.
It is an amenable number.
133300012201 is a deficient number, since it is larger than the sum of its proper divisors (1319802203).
133300012201 is a wasteful number, since it uses less digits than its factorization.
133300012201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1319802202.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 133300012201 its reverse (102210003331), we get a palindrome (235510015532).
The spelling of 133300012201 in words is "one hundred thirty-three billion, three hundred million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •