Base | Representation |
---|---|
bin | 111110000001101111… |
… | …1110010100011000100 |
3 | 110201211010021210022211 |
4 | 1330003133302203010 |
5 | 4140244334320312 |
6 | 141105323033204 |
7 | 12423612566152 |
oct | 1740337624304 |
9 | 421733253284 |
10 | 133202651332 |
11 | 51544473513 |
12 | 2199536b804 |
13 | c73a5610aa |
14 | 66389843d2 |
15 | 36e90d73a7 |
hex | 1f037f28c4 |
133202651332 has 12 divisors (see below), whose sum is σ = 235412607276. Its totient is φ = 65941906400.
The previous prime is 133202651303. The next prime is 133202651371. The reversal of 133202651332 is 233156202331.
It can be written as a sum of positive squares in 2 ways, for example, as 113303599236 + 19899052096 = 336606^2 + 141064^2 .
It is a super-2 number, since 2×1332026513322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133202651294 and 133202651303.
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 3 ways as a sum of consecutive naturals, for example, 164854363 + ... + 164855170.
It is an arithmetic number, because the mean of its divisors is an integer number (19617717273).
Almost surely, 2133202651332 is an apocalyptic number.
It is an amenable number.
133202651332 is a deficient number, since it is larger than the sum of its proper divisors (102209955944).
133202651332 is a wasteful number, since it uses less digits than its factorization.
133202651332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329709638 (or 329709636 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 133202651332 its reverse (233156202331), we get a palindrome (366358853663).
The spelling of 133202651332 in words is "one hundred thirty-three billion, two hundred two million, six hundred fifty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •