Base | Representation |
---|---|
bin | 11001000010001101100110… |
… | …101110100000110101010101 |
3 | 112102211202122000120012121012 |
4 | 121002031212232200311111 |
5 | 103412412333241231401 |
6 | 1030100414430302005 |
7 | 32122460121101366 |
oct | 3102154656406525 |
9 | 472752560505535 |
10 | 110103210102101 |
11 | 3209a566799537 |
12 | 104228a6357905 |
13 | 49588c3b788a8 |
14 | 1d29049459b6d |
15 | cae0856938bb |
hex | 642366ba0d55 |
110103210102101 has 16 divisors (see below), whose sum is σ = 110312681174208. Its totient is φ = 109893997382400.
The previous prime is 110103210102091. The next prime is 110103210102103. The reversal of 110103210102101 is 101201012301011.
It is a cyclic number.
It is not a de Polignac number, because 110103210102101 - 238 = 109828332195157 is a prime.
It is a super-2 number, since 2×1101032101021012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110103210102103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5163578426 + ... + 5163599748.
It is an arithmetic number, because the mean of its divisors is an integer number (6894542573388).
Almost surely, 2110103210102101 is an apocalyptic number.
It is an amenable number.
110103210102101 is a deficient number, since it is larger than the sum of its proper divisors (209471072107).
110103210102101 is a wasteful number, since it uses less digits than its factorization.
110103210102101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26932.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 110103210102101 its reverse (101201012301011), we get a palindrome (211304222403112).
The spelling of 110103210102101 in words is "one hundred ten trillion, one hundred three billion, two hundred ten million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •