Base | Representation |
---|---|
bin | 1001100110011010010101… |
… | …11010100010111010110001 |
3 | 2202202012020100201020110121 |
4 | 10303031022322202322301 |
5 | 10231340332401334301 |
6 | 112522134052330241 |
7 | 4306135532521054 |
oct | 463151272427261 |
9 | 82665210636417 |
10 | 21111021121201 |
11 | 67aa152072560 |
12 | 244b55a313981 |
13 | ba19b74a01ab |
14 | 52dac9332a9b |
15 | 26922d1993a1 |
hex | 13334aea2eb1 |
21111021121201 has 8 divisors (see below), whose sum is σ = 23258226691008. Its totient is φ = 19001819190000.
The previous prime is 21111021121189. The next prime is 21111021121217. The reversal of 21111021121201 is 10212112011112.
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 21111021121201 - 233 = 21102431186609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21111021121901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9500908485 + ... + 9500910706.
It is an arithmetic number, because the mean of its divisors is an integer number (2907278336376).
Almost surely, 221111021121201 is an apocalyptic number.
It is an amenable number.
21111021121201 is a deficient number, since it is larger than the sum of its proper divisors (2147205569807).
21111021121201 is a wasteful number, since it uses less digits than its factorization.
21111021121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19001819303.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 21111021121201 its reverse (10212112011112), we get a palindrome (31323133132313).
The spelling of 21111021121201 in words is "twenty-one trillion, one hundred eleven billion, twenty-one million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.081 sec. • engine limits •