Base | Representation |
---|---|
bin | 1001010010111100100110… |
… | …1000110010011110010111 |
3 | 1100012010110201220122100112 |
4 | 2110233021220302132113 |
5 | 2314430313142010403 |
6 | 33423302502033235 |
7 | 2103310431306644 |
oct | 224571150623627 |
9 | 40163421818315 |
10 | 10221110110103 |
11 | 3290826214402 |
12 | 1190b0511881b |
13 | 591b00b329b9 |
14 | 2749c0b06dcb |
15 | 12ad1b8149d8 |
hex | 94bc9a32797 |
10221110110103 has 4 divisors (see below), whose sum is σ = 10344256015128. Its totient is φ = 10097964205080.
The previous prime is 10221110110073. The next prime is 10221110110153. The reversal of 10221110110103 is 30101101112201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10221110110103 - 212 = 10221110106007 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 (10221110110153) 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 3 ways as a sum of consecutive naturals, for example, 61572952388 + ... + 61572952553.
It is an arithmetic number, because the mean of its divisors is an integer number (2586064003782).
Almost surely, 210221110110103 is an apocalyptic number.
10221110110103 is a deficient number, since it is larger than the sum of its proper divisors (123145905025).
10221110110103 is an equidigital number, since it uses as much as digits as its factorization.
10221110110103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123145905024.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 10221110110103 its reverse (30101101112201), we get a palindrome (40322211222304).
The spelling of 10221110110103 in words is "ten trillion, two hundred twenty-one billion, one hundred ten million, one hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •