Base | Representation |
---|---|
bin | 1001000111001111110100… |
… | …1110100111000110100101 |
3 | 1022110220122211212212200102 |
4 | 2101303331032213012211 |
5 | 2303132142210400401 |
6 | 33151102003153445 |
7 | 2052633502255223 |
oct | 221637516470645 |
9 | 38426584785612 |
10 | 10020112200101 |
11 | 32135621276a3 |
12 | 1159b6b375885 |
13 | 578b7ab58a43 |
14 | 268d9429db13 |
15 | 1259a597356b |
hex | 91cfd3a71a5 |
10020112200101 has 8 divisors (see below), whose sum is σ = 10032317596704. Its totient is φ = 10007913969360.
The previous prime is 10020112200073. The next prime is 10020112200113. The reversal of 10020112200101 is 10100221102001.
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-10020112200101 is a prime.
It is a super-2 number, since 2×100201122001012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020112220101) 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, 1009526 + ... + 4589048.
It is an arithmetic number, because the mean of its divisors is an integer number (1254039699588).
Almost surely, 210020112200101 is an apocalyptic number.
It is an amenable number.
10020112200101 is a deficient number, since it is larger than the sum of its proper divisors (12205396603).
10020112200101 is a wasteful number, since it uses less digits than its factorization.
10020112200101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3582931.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10020112200101 its reverse (10100221102001), we get a palindrome (20120333302102).
The spelling of 10020112200101 in words is "ten trillion, twenty billion, one hundred twelve million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •