Base | Representation |
---|---|
bin | 1101100000110000100… |
… | …1010110101111110010 |
3 | 211012011200100001221112 |
4 | 3120030021112233302 |
5 | 12300401243404132 |
6 | 254350122353322 |
7 | 22525306361216 |
oct | 3301411265762 |
9 | 735150301845 |
10 | 232132013042 |
11 | 8a4a0519186 |
12 | 38ba465b842 |
13 | 18b75300447 |
14 | b34174a946 |
15 | 608933aab2 |
hex | 360c256bf2 |
232132013042 has 8 divisors (see below), whose sum is σ = 348210446832. Its totient is φ = 116061864100.
The previous prime is 232132013033. The next prime is 232132013051. The reversal of 232132013042 is 240310231232.
232132013042 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (232132013033) and next prime (232132013051).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 232132012999 and 232132013017.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2000684 + ... + 2113527.
It is an arithmetic number, because the mean of its divisors is an integer number (43526305854).
Almost surely, 2232132013042 is an apocalyptic number.
232132013042 is a deficient number, since it is larger than the sum of its proper divisors (116078433790).
232132013042 is a wasteful number, since it uses less digits than its factorization.
232132013042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4142424.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 232132013042 its reverse (240310231232), we get a palindrome (472442244274).
The spelling of 232132013042 in words is "two hundred thirty-two billion, one hundred thirty-two million, thirteen thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •