Base | Representation |
---|---|
bin | 1001100110011000110100… |
… | …00010011111100011101001 |
3 | 2202202010010012201220122211 |
4 | 10303030122002133203221 |
5 | 10231332142441333001 |
6 | 112521520441045121 |
7 | 4306106314604656 |
oct | 463143202374351 |
9 | 82663105656584 |
10 | 21110201121001 |
11 | 67a9871211243 |
12 | 244b36b7867a1 |
13 | ba18b6636a85 |
14 | 52da4c47cc2d |
15 | 2691d11c1351 |
hex | 13331a09f8e9 |
21110201121001 has 8 divisors (see below), whose sum is σ = 21195628771104. Its totient is φ = 21024798950400.
The previous prime is 21110201120999. The next prime is 21110201121067. The reversal of 21110201121001 is 10012110201112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21110201121001 - 21 = 21110201120999 is a prime.
It is a super-2 number, since 2×211102011210012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21110201121071) 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, 4708615 + ... + 8024428.
It is an arithmetic number, because the mean of its divisors is an integer number (2649453596388).
Almost surely, 221110201121001 is an apocalyptic number.
It is an amenable number.
21110201121001 is a deficient number, since it is larger than the sum of its proper divisors (85427650103).
21110201121001 is a wasteful number, since it uses less digits than its factorization.
21110201121001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12739751.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21110201121001 its reverse (10012110201112), we get a palindrome (31122311322113).
The spelling of 21110201121001 in words is "twenty-one trillion, one hundred ten billion, two hundred one million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •