Base | Representation |
---|---|
bin | 111101100110111011… |
… | …1111100000101111111 |
3 | 110122111102110101110211 |
4 | 1323031313330011333 |
5 | 4131424032342343 |
6 | 140440144413251 |
7 | 12362410022464 |
oct | 1731567740577 |
9 | 418442411424 |
10 | 132303012223 |
11 | 51122668318 |
12 | 21784017227 |
13 | c626062a65 |
14 | 65912bd66b |
15 | 369512c79d |
hex | 1ecddfc17f |
132303012223 has 4 divisors (see below), whose sum is σ = 132503168728. Its totient is φ = 132102855720.
The previous prime is 132303012209. The next prime is 132303012251. The reversal of 132303012223 is 322210303231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322210303231 = 75611 ⋅4261421.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132303012223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132303012194 and 132303012203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132303012823) 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, 100077261 + ... + 100078582.
It is an arithmetic number, because the mean of its divisors is an integer number (33125792182).
Almost surely, 2132303012223 is an apocalyptic number.
132303012223 is a deficient number, since it is larger than the sum of its proper divisors (200156505).
132303012223 is an equidigital number, since it uses as much as digits as its factorization.
132303012223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200156504.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 132303012223 its reverse (322210303231), we get a palindrome (454513315454).
The spelling of 132303012223 in words is "one hundred thirty-two billion, three hundred three million, twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •