Base | Representation |
---|---|
bin | 1001001011111010001110… |
… | …0011000110100101001101 |
3 | 1022202120102010210100220201 |
4 | 2102332203203012211031 |
5 | 2310440213233013401 |
6 | 33251550124013501 |
7 | 2061500445322645 |
oct | 222764343064515 |
9 | 38676363710821 |
10 | 10100212001101 |
11 | 32445263a9742 |
12 | 11715a4691291 |
13 | 5835a48648b1 |
14 | 26cbd23b7525 |
15 | 127ae2aa7b01 |
hex | 92fa38c694d |
10100212001101 has 12 divisors (see below), whose sum is σ = 10332132653020. Its totient is φ = 9873387699840.
The previous prime is 10100212001029. The next prime is 10100212001147. The reversal of 10100212001101 is 10110021200101.
10100212001101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 7343698925476 + 2756513075625 = 2709926^2 + 1660275^2 .
It is not a de Polignac number, because 10100212001101 - 29 = 10100212000589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100212001401) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 926460 + ... + 4588981.
Almost surely, 210100212001101 is an apocalyptic number.
It is an amenable number.
10100212001101 is a deficient number, since it is larger than the sum of its proper divisors (231920651919).
10100212001101 is an frugal number, since it uses more digits than its factorization.
10100212001101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5516364 (or 5516317 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10100212001101 its reverse (10110021200101), we get a palindrome (20210233201202).
The spelling of 10100212001101 in words is "ten trillion, one hundred billion, two hundred twelve million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •