Base | Representation |
---|---|
bin | 1001010010111000100000… |
… | …1000000011110001010101 |
3 | 1100012000122010202122001011 |
4 | 2110232020020003301111 |
5 | 2314421040304324112 |
6 | 33423001440332221 |
7 | 2103241254155563 |
oct | 224561010036125 |
9 | 40160563678034 |
10 | 10220011011157 |
11 | 3290311865072 |
12 | 1190859014071 |
13 | 5919872091ac |
14 | 274918b60a33 |
15 | 12aca50aaaa7 |
hex | 94b88203c55 |
10220011011157 has 2 divisors, whose sum is σ = 10220011011158. Its totient is φ = 10220011011156.
The previous prime is 10220011011139. The next prime is 10220011011241. The reversal of 10220011011157 is 75111011002201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5904943740081 + 4315067271076 = 2430009^2 + 2077274^2 .
It is a cyclic number.
It is not a de Polignac number, because 10220011011157 - 27 = 10220011011029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10220011011557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110005505578 + 5110005505579.
It is an arithmetic number, because the mean of its divisors is an integer number (5110005505579).
Almost surely, 210220011011157 is an apocalyptic number.
It is an amenable number.
10220011011157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10220011011157 is an equidigital number, since it uses as much as digits as its factorization.
10220011011157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 22.
Adding to 10220011011157 its reverse (75111011002201), we get a palindrome (85331022013358).
The spelling of 10220011011157 in words is "ten trillion, two hundred twenty billion, eleven million, eleven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •