Base | Representation |
---|---|
bin | 11001000100000101101010… |
… | …100010010001011011001010 |
3 | 112110022002101011222000022002 |
4 | 121010011222202101123022 |
5 | 103422020341443133002 |
6 | 1030235534353431002 |
7 | 32135002524610163 |
oct | 3104055242213312 |
9 | 473262334860262 |
10 | 110232123021002 |
11 | 3213a1a9777534 |
12 | 10443882b6b462 |
13 | 4967ac9773a68 |
14 | 1d313983ca76a |
15 | cb25ccd74002 |
hex | 64416a8916ca |
110232123021002 has 8 divisors (see below), whose sum is σ = 165407300801796. Its totient is φ = 55096356087072.
The previous prime is 110232123021001. The next prime is 110232123021017. The reversal of 110232123021002 is 200120321232011.
It can be written as a sum of positive squares in 2 ways, for example, as 110060220739681 + 171902281321 = 10490959^2 + 414611^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1102321230210022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110232123021001) 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 3 ways as a sum of consecutive naturals, for example, 9852704723 + ... + 9852715910.
Almost surely, 2110232123021002 is an apocalyptic number.
110232123021002 is a deficient number, since it is larger than the sum of its proper divisors (55175177780794).
110232123021002 is a wasteful number, since it uses less digits than its factorization.
110232123021002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19705423432.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 110232123021002 its reverse (200120321232011), we get a palindrome (310352444253013).
The spelling of 110232123021002 in words is "one hundred ten trillion, two hundred thirty-two billion, one hundred twenty-three million, twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •