Base | Representation |
---|---|
bin | 10110111101111010111100… |
… | …010011111001011110100101 |
3 | 111020122200010220120100000202 |
4 | 112331322330103321132211 |
5 | 101214440441222400401 |
6 | 554500210353520245 |
7 | 30163614325654631 |
oct | 2675727423713645 |
9 | 436580126510022 |
10 | 101012200200101 |
11 | 2a2050406a2a73 |
12 | b3b4a11573085 |
13 | 4449542ba06a8 |
14 | 1ad30336abdc1 |
15 | ba285c15006b |
hex | 5bdebc4f97a5 |
101012200200101 has 8 divisors (see below), whose sum is σ = 109758587654400. Its totient is φ = 92608808332320.
The previous prime is 101012200200031. The next prime is 101012200200181. The reversal of 101012200200101 is 101002002210101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101012200200101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101012200200181) 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, 85748896016 + ... + 85748897193.
It is an arithmetic number, because the mean of its divisors is an integer number (13719823456800).
Almost surely, 2101012200200101 is an apocalyptic number.
It is an amenable number.
101012200200101 is a deficient number, since it is larger than the sum of its proper divisors (8746387454299).
101012200200101 is a wasteful number, since it uses less digits than its factorization.
101012200200101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171497793259.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101012200200101 its reverse (101002002210101), we get a palindrome (202014202410202).
The spelling of 101012200200101 in words is "one hundred one trillion, twelve billion, two hundred million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.541 sec. • engine limits •