Base | Representation |
---|---|
bin | 1011000111010111001001… |
… | …1100011101011000000101 |
3 | 1121021022210121112110220220 |
4 | 2301311302130131120011 |
5 | 3100212304104120401 |
6 | 41554144033414553 |
7 | 2400642205122012 |
oct | 261656234353005 |
9 | 47238717473826 |
10 | 12221102020101 |
11 | 3991a3853a037 |
12 | 145464640a459 |
13 | 6a85a27c3990 |
14 | 30370c48c709 |
15 | 162d73c45336 |
hex | b1d7271d605 |
12221102020101 has 8 divisors (see below), whose sum is σ = 17548249054560. Its totient is φ = 7520678166192.
The previous prime is 12221102020081. The next prime is 12221102020103. The reversal of 12221102020101 is 10102020112221.
12221102020101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12221102020101 - 26 = 12221102020037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12221102020103) 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, 156680795091 + ... + 156680795168.
It is an arithmetic number, because the mean of its divisors is an integer number (2193531131820).
Almost surely, 212221102020101 is an apocalyptic number.
It is an amenable number.
12221102020101 is a deficient number, since it is larger than the sum of its proper divisors (5327147034459).
12221102020101 is a wasteful number, since it uses less digits than its factorization.
12221102020101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 313361590275.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12221102020101 its reverse (10102020112221), we get a palindrome (22323122132322).
The spelling of 12221102020101 in words is "twelve trillion, two hundred twenty-one billion, one hundred two million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •