Base | Representation |
---|---|
bin | 110010001111111111010100… |
… | …000111101100000110100001 |
3 | 1001222111111110201020122022111 |
4 | 302033333110013230012201 |
5 | 212431340223324013441 |
6 | 2102010300524235321 |
7 | 64356542206421320 |
oct | 6217772407540641 |
9 | 1058444421218274 |
10 | 221001101001121 |
11 | 6446604a034761 |
12 | 209535b169bb41 |
13 | 964141197c9ac |
14 | 3c807206080b7 |
15 | 1a83b2c16e081 |
hex | c8ffd41ec1a1 |
221001101001121 has 16 divisors (see below), whose sum is σ = 255452695584768. Its totient is φ = 187281677653200.
The previous prime is 221001101001097. The next prime is 221001101001137. The reversal of 221001101001121 is 121100101100122.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 221001101001121 - 237 = 220863662047649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (221004101001121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 506825815 + ... + 507261676.
It is an arithmetic number, because the mean of its divisors is an integer number (15965793474048).
Almost surely, 2221001101001121 is an apocalyptic number.
It is an amenable number.
221001101001121 is a deficient number, since it is larger than the sum of its proper divisors (34451594583647).
221001101001121 is a wasteful number, since it uses less digits than its factorization.
221001101001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1014087852.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 221001101001121 its reverse (121100101100122), we get a palindrome (342101202101243).
Subtracting from 221001101001121 its reverse (121100101100122), we obtain a palindrome (99900999900999).
The spelling of 221001101001121 in words is "two hundred twenty-one trillion, one billion, one hundred one million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •