Base | Representation |
---|---|
bin | 1001000111011000110110… |
… | …0010111000001011111101 |
3 | 1022111010220120212012112012 |
4 | 2101312031202320023331 |
5 | 2303202122024311221 |
6 | 33152142134421005 |
7 | 2053050502351433 |
oct | 221661542701375 |
9 | 38433816765465 |
10 | 10022533432061 |
11 | 3214594921047 |
12 | 115a526201765 |
13 | 579175669787 |
14 | 269143a88d53 |
15 | 125a982e065b |
hex | 91d8d8b82fd |
10022533432061 has 2 divisors, whose sum is σ = 10022533432062. Its totient is φ = 10022533432060.
The previous prime is 10022533432019. The next prime is 10022533432081. The reversal of 10022533432061 is 16023433522001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9933723471961 + 88809960100 = 3151781^2 + 298010^2 .
It is a cyclic number.
It is not a de Polignac number, because 10022533432061 - 238 = 9747655525117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10022533432081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011266716030 + 5011266716031.
It is an arithmetic number, because the mean of its divisors is an integer number (5011266716031).
Almost surely, 210022533432061 is an apocalyptic number.
It is an amenable number.
10022533432061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10022533432061 is an equidigital number, since it uses as much as digits as its factorization.
10022533432061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 10022533432061 its reverse (16023433522001), we get a palindrome (26045966954062).
The spelling of 10022533432061 in words is "ten trillion, twenty-two billion, five hundred thirty-three million, four hundred thirty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •