Base | Representation |
---|---|
bin | 1001010010111000110101… |
… | …1011111100101010011001 |
3 | 1100012000212100102101001101 |
4 | 2110232031123330222121 |
5 | 2314421231112023001 |
6 | 33423014342151401 |
7 | 2103243415412104 |
oct | 224561533745231 |
9 | 40160770371041 |
10 | 10220100111001 |
11 | 3290358091100 |
12 | 1190882a22561 |
13 | 59199c8044b1 |
14 | 27492691573b |
15 | 12acacd0aa01 |
hex | 94b8d6fca99 |
10220100111001 has 6 divisors (see below), whose sum is σ = 11233663758506. Its totient is φ = 9291000100800.
The previous prime is 10220100110989. The next prime is 10220100111047. The reversal of 10220100111001 is 10011100102201.
It can be written as a sum of positive squares in only one way, i.e., 8961611024025 + 1258489086976 = 2993595^2 + 1121824^2 .
It is not a de Polignac number, because 10220100111001 - 27 = 10220100110873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10220100111101) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 42231818520 + ... + 42231818761.
Almost surely, 210220100111001 is an apocalyptic number.
10220100111001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10220100111001 is a deficient number, since it is larger than the sum of its proper divisors (1013563647505).
10220100111001 is an equidigital number, since it uses as much as digits as its factorization.
10220100111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84463637303 (or 84463637292 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10220100111001 its reverse (10011100102201), we get a palindrome (20231200213202).
The spelling of 10220100111001 in words is "ten trillion, two hundred twenty billion, one hundred million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •