Base | Representation |
---|---|
bin | 110001000010110110… |
… | …0101100111011100001 |
3 | 101001212002111100200111 |
4 | 1202011230230323201 |
5 | 3211200002200301 |
6 | 120215010251321 |
7 | 10415661543313 |
oct | 1420554547341 |
9 | 331762440614 |
10 | 105322303201 |
11 | 40737770295 |
12 | 184b4286b41 |
13 | 9c1637798b |
14 | 5151c5d7b3 |
15 | 2b16608551 |
hex | 1885b2cee1 |
105322303201 has 2 divisors, whose sum is σ = 105322303202. Its totient is φ = 105322303200.
The previous prime is 105322303189. The next prime is 105322303213. The reversal of 105322303201 is 102303223501.
It is a balanced prime because it is at equal distance from previous prime (105322303189) and next prime (105322303213).
It can be written as a sum of positive squares in only one way, i.e., 67678542801 + 37643760400 = 260151^2 + 194020^2 .
It is a cyclic number.
It is not a de Polignac number, because 105322303201 - 211 = 105322301153 is a prime.
It is a super-2 number, since 2×1053223032012 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105322303291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52661151600 + 52661151601.
It is an arithmetic number, because the mean of its divisors is an integer number (52661151601).
Almost surely, 2105322303201 is an apocalyptic number.
It is an amenable number.
105322303201 is a deficient number, since it is larger than the sum of its proper divisors (1).
105322303201 is an equidigital number, since it uses as much as digits as its factorization.
105322303201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 22.
Adding to 105322303201 its reverse (102303223501), we get a palindrome (207625526702).
The spelling of 105322303201 in words is "one hundred five billion, three hundred twenty-two million, three hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •