Base | Representation |
---|---|
bin | 110010011111111111110111… |
… | …001000101101111010001001 |
3 | 1002010101200000111210012112011 |
4 | 302133333313020231322021 |
5 | 213102401224211213001 |
6 | 2104211514402015521 |
7 | 64532165533451644 |
oct | 6237776710557211 |
9 | 1063350014705464 |
10 | 222101200101001 |
11 | 6484a654321981 |
12 | 20ab084a6475a1 |
13 | 96c1090144b40 |
14 | 3cbba80d0aa5b |
15 | 1aa2566697d51 |
hex | c9fff722de89 |
222101200101001 has 16 divisors (see below), whose sum is σ = 241094255641344. Its totient is φ = 203382783886464.
The previous prime is 222101200100957. The next prime is 222101200101041. The reversal of 222101200101001 is 100101002101222.
It is not a de Polignac number, because 222101200101001 - 29 = 222101200100489 is a prime.
It is a super-2 number, since 2×2221012001010012 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222101200101041) 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, 39403921 + ... + 44686366.
It is an arithmetic number, because the mean of its divisors is an integer number (15068390977584).
Almost surely, 2222101200101001 is an apocalyptic number.
It is an amenable number.
222101200101001 is a deficient number, since it is larger than the sum of its proper divisors (18993055540343).
222101200101001 is a wasteful number, since it uses less digits than its factorization.
222101200101001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84091920.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 222101200101001 its reverse (100101002101222), we get a palindrome (322202202202223).
The spelling of 222101200101001 in words is "two hundred twenty-two trillion, one hundred one billion, two hundred million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •