Base | Representation |
---|---|
bin | 111101111111011000… |
… | …0000001110110011000 |
3 | 110201121120110012201220 |
4 | 1323332300001312120 |
5 | 4140113443202412 |
6 | 141053400212040 |
7 | 12421625006304 |
oct | 1737660016630 |
9 | 421546405656 |
10 | 133123022232 |
11 | 51503525a42 |
12 | 2197276a020 |
13 | c726c00795 |
14 | 662c176d04 |
15 | 36e210868c |
hex | 1efec01d98 |
133123022232 has 16 divisors (see below), whose sum is σ = 332807555640. Its totient is φ = 44374340736.
The previous prime is 133123022183. The next prime is 133123022237. The reversal of 133123022232 is 232220321331.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 5546792593 = 133123022232 / (1 + 3 + 3 + 1 + 2 + 3 + 0 + 2 + 2 + 2 + 3 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133123022237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2773396273 + ... + 2773396320.
Almost surely, 2133123022232 is an apocalyptic number.
133123022232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
133123022232 is an abundant number, since it is smaller than the sum of its proper divisors (199684533408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133123022232 is a wasteful number, since it uses less digits than its factorization.
133123022232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5546792602 (or 5546792598 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 133123022232 its reverse (232220321331), we get a palindrome (365343343563).
The spelling of 133123022232 in words is "one hundred thirty-three billion, one hundred twenty-three million, twenty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •