Base | Representation |
---|---|
bin | 10110111110000010011001… |
… | …010001001100000110110001 |
3 | 111020200102210120210011110020 |
4 | 112332002121101030012301 |
5 | 101220103333232101001 |
6 | 554504012404554053 |
7 | 30164316533015556 |
oct | 2676023121140661 |
9 | 436612716704406 |
10 | 101020202222001 |
11 | 2a208477621507 |
12 | b3b64853b2929 |
13 | 444a219970baa |
14 | 1ad3592340a2d |
15 | ba2b798e9736 |
hex | 5be09944c1b1 |
101020202222001 has 4 divisors (see below), whose sum is σ = 134693602962672. Its totient is φ = 67346801481332.
The previous prime is 101020202221997. The next prime is 101020202222021. The reversal of 101020202222001 is 100222202020101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101020202222001 - 22 = 101020202221997 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101020202222021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16836700370331 + ... + 16836700370336.
It is an arithmetic number, because the mean of its divisors is an integer number (33673400740668).
Almost surely, 2101020202222001 is an apocalyptic number.
It is an amenable number.
101020202222001 is a deficient number, since it is larger than the sum of its proper divisors (33673400740671).
101020202222001 is an equidigital number, since it uses as much as digits as its factorization.
101020202222001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33673400740670.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 101020202222001 its reverse (100222202020101), we get a palindrome (201242404242102).
The spelling of 101020202222001 in words is "one hundred one trillion, twenty billion, two hundred two million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •