Base | Representation |
---|---|
bin | 110001101100000011… |
… | …1010010101101100101 |
3 | 101012102110021220112112 |
4 | 1203120013102231211 |
5 | 3222012440133123 |
6 | 121004122330405 |
7 | 10465151403146 |
oct | 1433007225545 |
9 | 335373256475 |
10 | 106705005413 |
11 | 41287214996 |
12 | 1881b359a05 |
13 | a0a697ac76 |
14 | 524374bacd |
15 | 2b97bd2d78 |
hex | 18d81d2b65 |
106705005413 has 2 divisors, whose sum is σ = 106705005414. Its totient is φ = 106705005412.
The previous prime is 106705005401. The next prime is 106705005431. The reversal of 106705005413 is 314500507601.
Together with next prime (106705005431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106704795649 + 209764 = 326657^2 + 458^2 .
It is a cyclic number.
It is not a de Polignac number, because 106705005413 - 210 = 106705004389 is a prime.
It is a super-2 number, since 2×1067050054132 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106705005413.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106705005443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53352502706 + 53352502707.
It is an arithmetic number, because the mean of its divisors is an integer number (53352502707).
Almost surely, 2106705005413 is an apocalyptic number.
It is an amenable number.
106705005413 is a deficient number, since it is larger than the sum of its proper divisors (1).
106705005413 is an equidigital number, since it uses as much as digits as its factorization.
106705005413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12600, while the sum is 32.
The spelling of 106705005413 in words is "one hundred six billion, seven hundred five million, five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •