Base | Representation |
---|---|
bin | 101111111111111010010011… |
… | …000100110001011000100001 |
3 | 1000200102222021122002201221100 |
4 | 233333322103010301120201 |
5 | 210132131011141200001 |
6 | 2024550015103545013 |
7 | 62315323343355663 |
oct | 5777722304613041 |
9 | 1020388248081840 |
10 | 211100110100001 |
11 | 612990658680a1 |
12 | 1b8147478bb169 |
13 | 90a3868c613a5 |
14 | 3a1b42aaba533 |
15 | 19612e9480586 |
hex | bffe93131621 |
211100110100001 has 24 divisors (see below), whose sum is σ = 309363363217376. Its totient is φ = 138687015430080.
The previous prime is 211100110099939. The next prime is 211100110100063. The reversal of 211100110100001 is 100001011001112.
It is an interprime number because it is at equal distance from previous prime (211100110099939) and next prime (211100110100063).
It is not a de Polignac number, because 211100110100001 - 213 = 211100110091809 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211100110000001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 136424995 + ... + 137963688.
Almost surely, 2211100110100001 is an apocalyptic number.
It is an amenable number.
211100110100001 is a deficient number, since it is larger than the sum of its proper divisors (98263253117375).
211100110100001 is a wasteful number, since it uses less digits than its factorization.
211100110100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 274389933 (or 274389930 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 211100110100001 its reverse (100001011001112), we get a palindrome (311101121101113).
The spelling of 211100110100001 in words is "two hundred eleven trillion, one hundred billion, one hundred ten million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •