Base | Representation |
---|---|
bin | 10110111110000010011001… |
… | …010001000110111110110011 |
3 | 111020200102210120202002122211 |
4 | 112332002121101012332303 |
5 | 101220103333230413021 |
6 | 554504012404312551 |
7 | 30164316532600432 |
oct | 2676023121067663 |
9 | 436612716662584 |
10 | 101020202201011 |
11 | 2a208477607765 |
12 | b3b64853a2757 |
13 | 444a219964482 |
14 | 1ad3592337119 |
15 | ba2b798e33e1 |
hex | 5be099446fb3 |
101020202201011 has 8 divisors (see below), whose sum is σ = 101092081885184. Its totient is φ = 100948335902280.
The previous prime is 101020202200913. The next prime is 101020202201047. The reversal of 101020202201011 is 110102202020101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101020202201011 - 229 = 101019665330099 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101020202200982 and 101020202201000.
It is not an unprimeable number, because it can be changed into a prime (101020202201111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11777350 + ... + 18459316.
It is an arithmetic number, because the mean of its divisors is an integer number (12636510235648).
Almost surely, 2101020202201011 is an apocalyptic number.
101020202201011 is a deficient number, since it is larger than the sum of its proper divisors (71879684173).
101020202201011 is an equidigital number, since it uses as much as digits as its factorization.
101020202201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6692721.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101020202201011 its reverse (110102202020101), we get a palindrome (211122404221112).
The spelling of 101020202201011 in words is "one hundred one trillion, twenty billion, two hundred two million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •