Base | Representation |
---|---|
bin | 1001001100011111011011… |
… | …1000101101101111000110 |
3 | 1022210112012020011212112202 |
4 | 2103013312320231233012 |
5 | 2311121142212010042 |
6 | 33300321203514502 |
7 | 2062303120001015 |
oct | 223076670555706 |
9 | 38715166155482 |
10 | 10110200110022 |
11 | 3248791431811 |
12 | 1173511688a32 |
13 | 584506c4a80c |
14 | 26d49cb22a7c |
15 | 127ec98b7632 |
hex | 931f6e2dbc6 |
10110200110022 has 4 divisors (see below), whose sum is σ = 15165300165036. Its totient is φ = 5055100055010.
The previous prime is 10110200110007. The next prime is 10110200110091. The reversal of 10110200110022 is 22001100201101.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×101102001100222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10110200109985 and 10110200110012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2527550027504 + ... + 2527550027507.
It is an arithmetic number, because the mean of its divisors is an integer number (3791325041259).
Almost surely, 210110200110022 is an apocalyptic number.
10110200110022 is a deficient number, since it is larger than the sum of its proper divisors (5055100055014).
10110200110022 is an equidigital number, since it uses as much as digits as its factorization.
10110200110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5055100055013.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10110200110022 its reverse (22001100201101), we get a palindrome (32111300311123).
The spelling of 10110200110022 in words is "ten trillion, one hundred ten billion, two hundred million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •