Base | Representation |
---|---|
bin | 110010010010111001100101… |
… | …000111110000101110101010 |
3 | 1002000012121201010210211211122 |
4 | 302102321211013300232222 |
5 | 212443124324131241020 |
6 | 2102242214500255242 |
7 | 64410152343600524 |
oct | 6222714507605652 |
9 | 1060177633724748 |
10 | 221201102212010 |
11 | 64532951552698 |
12 | 209863096a1522 |
13 | 965723630406b |
14 | 3c8a294922a14 |
15 | 1a88e35782125 |
hex | c92e651f0baa |
221201102212010 has 8 divisors (see below), whose sum is σ = 398161983981636. Its totient is φ = 88480440884800.
The previous prime is 221201102211953. The next prime is 221201102212033. The reversal of 221201102212010 is 10212201102122.
221201102212010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 207056530312681 + 14144571899329 = 14389459^2 + 3760927^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 221201102212010.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11060055110591 + ... + 11060055110610.
Almost surely, 2221201102212010 is an apocalyptic number.
221201102212010 is a deficient number, since it is larger than the sum of its proper divisors (176960881769626).
221201102212010 is a wasteful number, since it uses less digits than its factorization.
221201102212010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22120110221208.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 221201102212010 its reverse (10212201102122), we get a palindrome (231413303314132).
The spelling of 221201102212010 in words is "two hundred twenty-one trillion, two hundred one billion, one hundred two million, two hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •