Base | Representation |
---|---|
bin | 1110100011111110000001… |
… | …01001010000010111100111 |
3 | 11012101021221002122201101022 |
4 | 13101333000221100113213 |
5 | 13144122443041411403 |
6 | 152034445054521355 |
7 | 6513346203301013 |
oct | 721770051202747 |
9 | 135337832581338 |
10 | 32022213232103 |
11 | a2265a96089a6 |
12 | 371215250625b |
13 | 14b38b2a63633 |
14 | 7c9c52045543 |
15 | 3a7e87ea4d38 |
hex | 1d1fc0a505e7 |
32022213232103 has 8 divisors (see below), whose sum is σ = 32038337286096. Its totient is φ = 32006090390400.
The previous prime is 32022213232081. The next prime is 32022213232117. The reversal of 32022213232103 is 30123231222023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32022213232103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32022213232123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55077800 + ... + 55656162.
It is an arithmetic number, because the mean of its divisors is an integer number (4004792160762).
Almost surely, 232022213232103 is an apocalyptic number.
32022213232103 is a deficient number, since it is larger than the sum of its proper divisors (16124053993).
32022213232103 is a wasteful number, since it uses less digits than its factorization.
32022213232103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 606145.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 32022213232103 its reverse (30123231222023), we get a palindrome (62145444454126).
The spelling of 32022213232103 in words is "thirty-two trillion, twenty-two billion, two hundred thirteen million, two hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •