Base | Representation |
---|---|
bin | 11001000100000101110110… |
… | …111001000001010101101111 |
3 | 112110022002220122000102202021 |
4 | 121010011312321001111233 |
5 | 103422021303024423043 |
6 | 1030240011120411011 |
7 | 32135010622546234 |
oct | 3104056671012557 |
9 | 473262818012667 |
10 | 110232330311023 |
11 | 3213a2a57895a8 |
12 | 10443920476a67 |
13 | 4967b306b128b |
14 | 1d313b7b4978b |
15 | cb25e116d3ed |
hex | 644176e4156f |
110232330311023 has 6 divisors (see below), whose sum is σ = 116339384622264. Its totient is φ = 104430628715364.
The previous prime is 110232330310981. The next prime is 110232330311027. The reversal of 110232330311023 is 320113033232011.
It is not a de Polignac number, because 110232330311023 - 29 = 110232330310511 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 (110232330311027) 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 5 ways as a sum of consecutive naturals, for example, 152676357411 + ... + 152676358132.
It is an arithmetic number, because the mean of its divisors is an integer number (19389897437044).
Almost surely, 2110232330311023 is an apocalyptic number.
110232330311023 is a deficient number, since it is larger than the sum of its proper divisors (6107054311241).
110232330311023 is an equidigital number, since it uses as much as digits as its factorization.
110232330311023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305352715581 (or 305352715562 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 110232330311023 its reverse (320113033232011), we get a palindrome (430345363543034).
The spelling of 110232330311023 in words is "one hundred ten trillion, two hundred thirty-two billion, three hundred thirty million, three hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •