Base | Representation |
---|---|
bin | 111101111111101001… |
… | …1100000100110100001 |
3 | 110201122012221202022102 |
4 | 1323333103200212201 |
5 | 4140123333320413 |
6 | 141054331420145 |
7 | 12422100035030 |
oct | 1737723404641 |
9 | 421565852272 |
10 | 133132323233 |
11 | 515087a8a18 |
12 | 219758b4655 |
13 | c728b09130 |
14 | 662d4b8717 |
15 | 36e2d44458 |
hex | 1eff4e09a1 |
133132323233 has 8 divisors (see below), whose sum is σ = 163855167168. Its totient is φ = 105335464464.
The previous prime is 133132323221. The next prime is 133132323241. The reversal of 133132323233 is 332323231331.
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 133132323233 - 28 = 133132322977 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133132323196 and 133132323205.
It is not an unprimeable number, because it can be changed into a prime (133132329233) 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, 731496191 + ... + 731496372.
It is an arithmetic number, because the mean of its divisors is an integer number (20481895896).
Almost surely, 2133132323233 is an apocalyptic number.
133132323233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
133132323233 is a deficient number, since it is larger than the sum of its proper divisors (30722843935).
133132323233 is a wasteful number, since it uses less digits than its factorization.
133132323233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1462992583.
The product of its digits is 17496, while the sum is 29.
Adding to 133132323233 its reverse (332323231331), we get a palindrome (465455554564).
The spelling of 133132323233 in words is "one hundred thirty-three billion, one hundred thirty-two million, three hundred twenty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •