Base | Representation |
---|---|
bin | 1101100010001000110… |
… | …1100101110100010111 |
3 | 211020010110221122022020 |
4 | 3120202031211310113 |
5 | 12302131032101403 |
6 | 254450545304223 |
7 | 22540423165014 |
oct | 3304215456427 |
9 | 736113848266 |
10 | 232502222103 |
11 | 8a670496788 |
12 | 39088635073 |
13 | 18c03c10c68 |
14 | b37899870b |
15 | 60abab7453 |
hex | 3622365d17 |
232502222103 has 12 divisors (see below), whose sum is σ = 317380001400. Its totient is φ = 151396792176.
The previous prime is 232502222093. The next prime is 232502222201. The reversal of 232502222103 is 301222205232.
It is a happy number.
232502222103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 232502222103 - 230 = 231428480279 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232502222803) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 20951928 + ... + 20963021.
It is an arithmetic number, because the mean of its divisors is an integer number (26448333450).
Almost surely, 2232502222103 is an apocalyptic number.
232502222103 is a deficient number, since it is larger than the sum of its proper divisors (84877779297).
232502222103 is an equidigital number, since it uses as much as digits as its factorization.
232502222103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41915038 (or 41914995 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 24.
Adding to 232502222103 its reverse (301222205232), we get a palindrome (533724427335).
The spelling of 232502222103 in words is "two hundred thirty-two billion, five hundred two million, two hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •