Base | Representation |
---|---|
bin | 1010111011110010010000… |
… | …1101100101000101100101 |
3 | 1120120022110020210220201202 |
4 | 2232330210031211011211 |
5 | 3033433002034013221 |
6 | 41322533155132245 |
7 | 2350401562264115 |
oct | 256744415450545 |
9 | 46508406726652 |
10 | 12022221001061 |
11 | 3915660377897 |
12 | 1421ba15a4085 |
13 | 6928c926cb1b |
14 | 2d7c42c4b045 |
15 | 15cad3b55d0b |
hex | aef24365165 |
12022221001061 has 2 divisors, whose sum is σ = 12022221001062. Its totient is φ = 12022221001060.
The previous prime is 12022221001039. The next prime is 12022221001093. The reversal of 12022221001061 is 16010012222021.
12022221001061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10672511468161 + 1349709532900 = 3266881^2 + 1161770^2 .
It is a cyclic number.
It is not a de Polignac number, because 12022221001061 - 214 = 12022220984677 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12022221001961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6011110500530 + 6011110500531.
It is an arithmetic number, because the mean of its divisors is an integer number (6011110500531).
Almost surely, 212022221001061 is an apocalyptic number.
It is an amenable number.
12022221001061 is a deficient number, since it is larger than the sum of its proper divisors (1).
12022221001061 is an equidigital number, since it uses as much as digits as its factorization.
12022221001061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 12022221001061 its reverse (16010012222021), we get a palindrome (28032233223082).
The spelling of 12022221001061 in words is "twelve trillion, twenty-two billion, two hundred twenty-one million, one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •