Base | Representation |
---|---|
bin | 10100100001110110… |
… | …10110000100100101 |
3 | 1001110002201200001111 |
4 | 22100323112010211 |
5 | 140032440114342 |
6 | 5021351025021 |
7 | 540056305261 |
oct | 122073260445 |
9 | 31402650044 |
10 | 11021410597 |
11 | 47463319aa |
12 | 217706b171 |
13 | 10684b2b42 |
14 | 767a850a1 |
15 | 4478bd217 |
hex | 290ed6125 |
11021410597 has 2 divisors, whose sum is σ = 11021410598. Its totient is φ = 11021410596.
The previous prime is 11021410583. The next prime is 11021410637. The reversal of 11021410597 is 79501412011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7777652481 + 3243758116 = 88191^2 + 56954^2 .
It is a cyclic number.
It is not a de Polignac number, because 11021410597 - 27 = 11021410469 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021410507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510705298 + 5510705299.
It is an arithmetic number, because the mean of its divisors is an integer number (5510705299).
Almost surely, 211021410597 is an apocalyptic number.
It is an amenable number.
11021410597 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021410597 is an equidigital number, since it uses as much as digits as its factorization.
11021410597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 31.
The spelling of 11021410597 in words is "eleven billion, twenty-one million, four hundred ten thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •