Base | Representation |
---|---|
bin | 111101111111101001… |
… | …0101010001001111111 |
3 | 110201122012112102101210 |
4 | 1323333102222021333 |
5 | 4140123304201343 |
6 | 141054322535503 |
7 | 12422065115613 |
oct | 1737722521177 |
9 | 421565472353 |
10 | 133132100223 |
11 | 51508666411 |
12 | 21975807593 |
13 | c728a5b785 |
14 | 662d45b343 |
15 | 36e2ced333 |
hex | 1eff4aa27f |
133132100223 has 8 divisors (see below), whose sum is σ = 177629330736. Its totient is φ = 88694801600.
The previous prime is 133132100197. The next prime is 133132100239. The reversal of 133132100223 is 322001231331.
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 133132100223 - 25 = 133132100191 is a prime.
It is a super-2 number, since 2×1331321002232 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 133132100223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133132100243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14977788 + ... + 14986673.
It is an arithmetic number, because the mean of its divisors is an integer number (22203666342).
Almost surely, 2133132100223 is an apocalyptic number.
133132100223 is a deficient number, since it is larger than the sum of its proper divisors (44497230513).
133132100223 is a wasteful number, since it uses less digits than its factorization.
133132100223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29965945.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 133132100223 its reverse (322001231331), we get a palindrome (455133331554).
The spelling of 133132100223 in words is "one hundred thirty-three billion, one hundred thirty-two million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •