Base | Representation |
---|---|
bin | 1001100110011010010011… |
… | …01101110010100100001001 |
3 | 2202202012011221211222122101 |
4 | 10303031021231302210021 |
5 | 10231340312224001301 |
6 | 112522132053153401 |
7 | 4306135166506210 |
oct | 463151155624411 |
9 | 82665157758571 |
10 | 21111001000201 |
11 | 67aa14177a332 |
12 | 244b55362b861 |
13 | ba19b3276988 |
14 | 52dac67b6077 |
15 | 26922b522701 |
hex | 133349b72909 |
21111001000201 has 8 divisors (see below), whose sum is σ = 24138820056320. Its totient is φ = 18086172386688.
The previous prime is 21111001000127. The next prime is 21111001000207. The reversal of 21111001000201 is 10200010011112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-21111001000201 is a prime.
It is a super-3 number, since 3×211110010002013 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21111001000207) 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, 747595521 + ... + 747623758.
It is an arithmetic number, because the mean of its divisors is an integer number (3017352507040).
Almost surely, 221111001000201 is an apocalyptic number.
It is an amenable number.
21111001000201 is a deficient number, since it is larger than the sum of its proper divisors (3027819056119).
21111001000201 is a wasteful number, since it uses less digits than its factorization.
21111001000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1495221303.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 21111001000201 its reverse (10200010011112), we get a palindrome (31311011011313).
The spelling of 21111001000201 in words is "twenty-one trillion, one hundred eleven billion, one million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •