Base | Representation |
---|---|
bin | 111101100100110110… |
… | …0111110110111011101 |
3 | 110122022112202222110121 |
4 | 1323021230332313131 |
5 | 4131303123444013 |
6 | 140425204434541 |
7 | 12360600135130 |
oct | 1731154766735 |
9 | 418275688417 |
10 | 132233031133 |
11 | 5109710a505 |
12 | 217646a8a51 |
13 | c6146cca28 |
14 | 6585ca4217 |
15 | 368de0758d |
hex | 1ec9b3eddd |
132233031133 has 4 divisors (see below), whose sum is σ = 151123464160. Its totient is φ = 113342598108.
The previous prime is 132233031131. The next prime is 132233031143. The reversal of 132233031133 is 331130332231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 132233031133 - 21 = 132233031131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132233031098 and 132233031107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132233031131) 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, 9445216503 + ... + 9445216516.
It is an arithmetic number, because the mean of its divisors is an integer number (37780866040).
Almost surely, 2132233031133 is an apocalyptic number.
It is an amenable number.
132233031133 is a deficient number, since it is larger than the sum of its proper divisors (18890433027).
132233031133 is an equidigital number, since it uses as much as digits as its factorization.
132233031133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18890433026.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 132233031133 its reverse (331130332231), we get a palindrome (463363363364).
The spelling of 132233031133 in words is "one hundred thirty-two billion, two hundred thirty-three million, thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •