Base | Representation |
---|---|
bin | 111101100000111110… |
… | …1000010101010000001 |
3 | 110121222111010220011012 |
4 | 1323001331002222001 |
5 | 4131021333220413 |
6 | 140404242130305 |
7 | 12354431112266 |
oct | 1730175025201 |
9 | 417874126135 |
10 | 132103023233 |
11 | 5102a792665 |
12 | 21729050995 |
13 | c5c37b078c |
14 | 657290126d |
15 | 36827c67a8 |
hex | 1ec1f42a81 |
132103023233 has 8 divisors (see below), whose sum is σ = 135192314400. Its totient is φ = 129014510688.
The previous prime is 132103023229. The next prime is 132103023251. The reversal of 132103023233 is 332320301231.
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 132103023233 - 22 = 132103023229 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132103023199 and 132103023208.
It is not an unprimeable number, because it can be changed into a prime (132103023253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 155933 + ... + 537141.
It is an arithmetic number, because the mean of its divisors is an integer number (16899039300).
Almost surely, 2132103023233 is an apocalyptic number.
It is an amenable number.
132103023233 is a deficient number, since it is larger than the sum of its proper divisors (3089291167).
132103023233 is an equidigital number, since it uses as much as digits as its factorization.
132103023233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389311.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 132103023233 its reverse (332320301231), we get a palindrome (464423324464).
The spelling of 132103023233 in words is "one hundred thirty-two billion, one hundred three million, twenty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •