Base | Representation |
---|---|
bin | 101111100110110000… |
… | …0100011111111001111 |
3 | 100202212201202102210101 |
4 | 1133031200203333033 |
5 | 3133332410104403 |
6 | 114544220551531 |
7 | 10246256423611 |
oct | 1371540437717 |
9 | 322781672711 |
10 | 102232113103 |
11 | 3a3a13a977a |
12 | 179913b25a7 |
13 | 98430a5b23 |
14 | 4d3b69adb1 |
15 | 29d519b71d |
hex | 17cd823fcf |
102232113103 has 4 divisors (see below), whose sum is σ = 102296129800. Its totient is φ = 102168096408.
The previous prime is 102232113097. The next prime is 102232113169. The reversal of 102232113103 is 301311232201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301311232201 = 7 ⋅43044461743.
It is a cyclic number.
It is not a de Polignac number, because 102232113103 - 213 = 102232104911 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 (102232113173) 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 3 ways as a sum of consecutive naturals, for example, 32005953 + ... + 32009146.
It is an arithmetic number, because the mean of its divisors is an integer number (25574032450).
Almost surely, 2102232113103 is an apocalyptic number.
102232113103 is a deficient number, since it is larger than the sum of its proper divisors (64016697).
102232113103 is an equidigital number, since it uses as much as digits as its factorization.
102232113103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64016696.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 102232113103 its reverse (301311232201), we get a palindrome (403543345304).
The spelling of 102232113103 in words is "one hundred two billion, two hundred thirty-two million, one hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •