Base | Representation |
---|---|
bin | 110011010111001100… |
… | …1111111100110100110 |
3 | 101112201000100100101120 |
4 | 1212232121333212212 |
5 | 3301343324411402 |
6 | 122400552434410 |
7 | 10653225334464 |
oct | 1465631774646 |
9 | 345630310346 |
10 | 110300232102 |
11 | 42861672a15 |
12 | 194633a8a06 |
13 | a52a779538 |
14 | 54a5017834 |
15 | 2d086503bc |
hex | 19ae67f9a6 |
110300232102 has 8 divisors (see below), whose sum is σ = 220600464216. Its totient is φ = 36766744032.
The previous prime is 110300232101. The next prime is 110300232113. The reversal of 110300232102 is 201232003011.
It is a sphenic number, since it is the product of 3 distinct primes.
110300232102 is an admirable number.
It is a super-2 number, since 2×1103002321022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110300232101) 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, 9191686003 + ... + 9191686014.
It is an arithmetic number, because the mean of its divisors is an integer number (27575058027).
Almost surely, 2110300232102 is an apocalyptic number.
110300232102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110300232102 is a wasteful number, since it uses less digits than its factorization.
110300232102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18383372022.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 110300232102 its reverse (201232003011), we get a palindrome (311532235113).
The spelling of 110300232102 in words is "one hundred ten billion, three hundred million, two hundred thirty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •