Base | Representation |
---|---|
bin | 10100011100000010… |
… | …01011110001000001 |
3 | 1001022200220022200012 |
4 | 22032001023301001 |
5 | 134432442001401 |
6 | 5012445034305 |
7 | 535624433312 |
oct | 121601136101 |
9 | 31280808605 |
10 | 10972609601 |
11 | 472082aaa8 |
12 | 2162855995 |
13 | 105b357405 |
14 | 7613c0609 |
15 | 44347d8bb |
hex | 28e04bc41 |
10972609601 has 2 divisors, whose sum is σ = 10972609602. Its totient is φ = 10972609600.
The previous prime is 10972609577. The next prime is 10972609607. The reversal of 10972609601 is 10690627901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9682363201 + 1290246400 = 98399^2 + 35920^2 .
It is a cyclic number.
It is not a de Polignac number, because 10972609601 - 230 = 9898867777 is a prime.
It is a super-2 number, since 2×109726096012 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10972609607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5486304800 + 5486304801.
It is an arithmetic number, because the mean of its divisors is an integer number (5486304801).
Almost surely, 210972609601 is an apocalyptic number.
It is an amenable number.
10972609601 is a deficient number, since it is larger than the sum of its proper divisors (1).
10972609601 is an equidigital number, since it uses as much as digits as its factorization.
10972609601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 41.
The spelling of 10972609601 in words is "ten billion, nine hundred seventy-two million, six hundred nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •