Base | Representation |
---|---|
bin | 100000000010001000111… |
… | …110000000000011110101 |
3 | 21210102222212012221222221 |
4 | 200002020332000003311 |
5 | 242031301212210401 |
6 | 4403134545122341 |
7 | 315016535361406 |
oct | 40021076000365 |
9 | 7712885187887 |
10 | 2201321210101 |
11 | 779636486762 |
12 | 2b676a0293b1 |
13 | 12c778506670 |
14 | 7878a2139ad |
15 | 3c3dc4317a1 |
hex | 20088f800f5 |
2201321210101 has 4 divisors (see below), whose sum is σ = 2370653610892. Its totient is φ = 2031988809312.
The previous prime is 2201321210087. The next prime is 2201321210119. The reversal of 2201321210101 is 1010121231022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 698183909476 + 1503137300625 = 835574^2 + 1226025^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201321210101 - 25 = 2201321210069 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 (2201321210701) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84666200376 + ... + 84666200401.
It is an arithmetic number, because the mean of its divisors is an integer number (592663402723).
Almost surely, 22201321210101 is an apocalyptic number.
It is an amenable number.
2201321210101 is a deficient number, since it is larger than the sum of its proper divisors (169332400791).
2201321210101 is a wasteful number, since it uses less digits than its factorization.
2201321210101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169332400790.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2201321210101 its reverse (1010121231022), we get a palindrome (3211442441123).
The spelling of 2201321210101 in words is "two trillion, two hundred one billion, three hundred twenty-one million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •