Base | Representation |
---|---|
bin | 110001100001111011… |
… | …1100001000001010101 |
3 | 101011112210010101011012 |
4 | 1203003313201001111 |
5 | 3220314010403042 |
6 | 120510310022005 |
7 | 10453555230332 |
oct | 1430367410125 |
9 | 334483111135 |
10 | 106365325397 |
11 | 411224a9301 |
12 | 18745647905 |
13 | a051499186 |
14 | 52105a9989 |
15 | 2b77e86e82 |
hex | 18c3de1055 |
106365325397 has 2 divisors, whose sum is σ = 106365325398. Its totient is φ = 106365325396.
The previous prime is 106365325301. The next prime is 106365325411. The reversal of 106365325397 is 793523563601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104619255601 + 1746069796 = 323449^2 + 41786^2 .
It is a cyclic number.
It is not a de Polignac number, because 106365325397 - 224 = 106348548181 is a prime.
It is a super-2 number, since 2×1063653253972 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106365325097) 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, 53182662698 + 53182662699.
It is an arithmetic number, because the mean of its divisors is an integer number (53182662699).
Almost surely, 2106365325397 is an apocalyptic number.
It is an amenable number.
106365325397 is a deficient number, since it is larger than the sum of its proper divisors (1).
106365325397 is an equidigital number, since it uses as much as digits as its factorization.
106365325397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3061800, while the sum is 50.
Adding to 106365325397 its reverse (793523563601), we get a palindrome (899888888998).
The spelling of 106365325397 in words is "one hundred six billion, three hundred sixty-five million, three hundred twenty-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.196 sec. • engine limits •