Base | Representation |
---|---|
bin | 110010100001101111011011… |
… | …110100111101001011000101 |
3 | 1002010211010020122100110100221 |
4 | 302201233123310331023011 |
5 | 213111332102230120401 |
6 | 2104342530223304341 |
7 | 64543636364455366 |
oct | 6241573364751305 |
9 | 1063733218313327 |
10 | 222221001020101 |
11 | 64896440871626 |
12 | 20b0bb0374b0b1 |
13 | 96cc473007355 |
14 | 3cc37a7a2db6d |
15 | 1aa5728e267a1 |
hex | ca1bdbd3d2c5 |
222221001020101 has 8 divisors (see below), whose sum is σ = 226993546500480. Its totient is φ = 217450307167968.
The previous prime is 222221001020093. The next prime is 222221001020111. The reversal of 222221001020101 is 101020100122222.
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 222221001020101 - 23 = 222221001020093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222221001020111) 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, 462664456 + ... + 463144513.
It is an arithmetic number, because the mean of its divisors is an integer number (28374193312560).
Almost surely, 2222221001020101 is an apocalyptic number.
It is an amenable number.
222221001020101 is a deficient number, since it is larger than the sum of its proper divisors (4772545480379).
222221001020101 is an equidigital number, since it uses as much as digits as its factorization.
222221001020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 925814123.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 222221001020101 its reverse (101020100122222), we get a palindrome (323241101142323).
The spelling of 222221001020101 in words is "two hundred twenty-two trillion, two hundred twenty-one billion, one million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •