Base | Representation |
---|---|
bin | 11101101100000110110… |
… | …11001110011000000101 |
3 | 10121112002101002002212120 |
4 | 32312003123032120011 |
5 | 113203142210414341 |
6 | 2100344424440153 |
7 | 133462221433131 |
oct | 16660333163005 |
9 | 3545071062776 |
10 | 1020112201221 |
11 | 36369981a3a3 |
12 | 145855619059 |
13 | 75271c99719 |
14 | 375335b83c1 |
15 | 1b807297066 |
hex | ed836ce605 |
1020112201221 has 16 divisors (see below), whose sum is σ = 1396942962048. Its totient is φ = 661678977600.
The previous prime is 1020112201217. The next prime is 1020112201237. The reversal of 1020112201221 is 1221022110201.
1020112201221 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1020112201221 - 22 = 1020112201217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1020112201221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020112201291) 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, 6509416 + ... + 6664286.
It is an arithmetic number, because the mean of its divisors is an integer number (87308935128).
Almost surely, 21020112201221 is an apocalyptic number.
It is an amenable number.
1020112201221 is a deficient number, since it is larger than the sum of its proper divisors (376830760827).
1020112201221 is a wasteful number, since it uses less digits than its factorization.
1020112201221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 214252.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1020112201221 its reverse (1221022110201), we get a palindrome (2241134311422).
The spelling of 1020112201221 in words is "one trillion, twenty billion, one hundred twelve million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •