Base | Representation |
---|---|
bin | 11001000011101000110111… |
… | …011000011000101000110111 |
3 | 112110012010120002212210121112 |
4 | 121003220313120120220313 |
5 | 103421014024201120043 |
6 | 1030213422110305235 |
7 | 32132526316464320 |
oct | 3103506730305067 |
9 | 473163502783545 |
10 | 110201200020023 |
11 | 32128080521182 |
12 | 10439892ab821b |
13 | 4964c0c0c0c48 |
14 | 1d2daa3559447 |
15 | cb18bd1c8518 |
hex | 643a37618a37 |
110201200020023 has 8 divisors (see below), whose sum is σ = 125945803596192. Its totient is φ = 94456990194336.
The previous prime is 110201200020019. The next prime is 110201200020089. The reversal of 110201200020023 is 320020002102011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110201200020023 - 22 = 110201200020019 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 (110201200020823) 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 7 ways as a sum of consecutive naturals, for example, 97837640 + ... + 98957597.
It is an arithmetic number, because the mean of its divisors is an integer number (15743225449524).
Almost surely, 2110201200020023 is an apocalyptic number.
110201200020023 is a deficient number, since it is larger than the sum of its proper divisors (15744603576169).
110201200020023 is an equidigital number, since it uses as much as digits as its factorization.
110201200020023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196875241.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 110201200020023 its reverse (320020002102011), we get a palindrome (430221202122034).
The spelling of 110201200020023 in words is "one hundred ten trillion, two hundred one billion, two hundred million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •