Base | Representation |
---|---|
bin | 1001001011111001110011… |
… | …1100011011110011001101 |
3 | 1022202120010102022010220000 |
4 | 2102332130330123303031 |
5 | 2310440001401413401 |
6 | 33251531125114513 |
7 | 2061464631456612 |
oct | 222763474336315 |
9 | 38676112263800 |
10 | 10100101201101 |
11 | 3244479900a9a |
12 | 1171573558a39 |
13 | 58358790c372 |
14 | 26cbc17b4509 |
15 | 127ad7ebd186 |
hex | 92f9cf1bccd |
10100101201101 has 40 divisors (see below), whose sum is σ = 15114036896640. Its totient is φ = 6721698562848.
The previous prime is 10100101201093. The next prime is 10100101201103. The reversal of 10100101201101 is 10110210100101.
It is not a de Polignac number, because 10100101201101 - 23 = 10100101201093 is a prime.
It is a super-2 number, since 2×101001012011012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100101201103) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 298246696 + ... + 298280558.
It is an arithmetic number, because the mean of its divisors is an integer number (377850922416).
Almost surely, 210100101201101 is an apocalyptic number.
It is an amenable number.
10100101201101 is a deficient number, since it is larger than the sum of its proper divisors (5013935695539).
10100101201101 is an equidigital number, since it uses as much as digits as its factorization.
10100101201101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40167 (or 40158 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10100101201101 its reverse (10110210100101), we get a palindrome (20210311301202).
The spelling of 10100101201101 in words is "ten trillion, one hundred billion, one hundred one million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •