Base | Representation |
---|---|
bin | 110011010001010010… |
… | …1111000100000111001 |
3 | 101112012012101020112010 |
4 | 1212202211320200321 |
5 | 3300442104202301 |
6 | 122325152240133 |
7 | 10645300514163 |
oct | 1464245704071 |
9 | 345165336463 |
10 | 110102022201 |
11 | 4276a7a2986 |
12 | 19408b40049 |
13 | a4c869ac82 |
14 | 548697d933 |
15 | 2ce604b5d6 |
hex | 19a2978839 |
110102022201 has 8 divisors (see below), whose sum is σ = 146804254720. Its totient is φ = 73400568912.
The previous prime is 110102022193. The next prime is 110102022209. The reversal of 110102022201 is 102220201011.
It is an interprime number because it is at equal distance from previous prime (110102022193) and next prime (110102022209).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110102022201 - 23 = 110102022193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110102022209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 363336 + ... + 593478.
It is an arithmetic number, because the mean of its divisors is an integer number (18350531840).
Almost surely, 2110102022201 is an apocalyptic number.
It is an amenable number.
110102022201 is a deficient number, since it is larger than the sum of its proper divisors (36702232519).
110102022201 is a wasteful number, since it uses less digits than its factorization.
110102022201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389615.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 110102022201 its reverse (102220201011), we get a palindrome (212322223212).
The spelling of 110102022201 in words is "one hundred ten billion, one hundred two million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •