Base | Representation |
---|---|
bin | 110001100100101011… |
… | …0000111000101000111 |
3 | 101011210012001200212212 |
4 | 1203021112013011013 |
5 | 3221011022403222 |
6 | 120523351534035 |
7 | 10456052352602 |
oct | 1431126070507 |
9 | 334705050785 |
10 | 106457231687 |
11 | 4116a371914 |
12 | 1877038a31b |
13 | a0675379b1 |
14 | 521c891339 |
15 | 2b8108d6e2 |
hex | 18c9587147 |
106457231687 has 2 divisors, whose sum is σ = 106457231688. Its totient is φ = 106457231686.
The previous prime is 106457231627. The next prime is 106457231711. The reversal of 106457231687 is 786132754601.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106457231687 is a prime.
It is a super-2 number, since 2×1064572316872 (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 (106457231627) 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, 53228615843 + 53228615844.
It is an arithmetic number, because the mean of its divisors is an integer number (53228615844).
Almost surely, 2106457231687 is an apocalyptic number.
106457231687 is a deficient number, since it is larger than the sum of its proper divisors (1).
106457231687 is an equidigital number, since it uses as much as digits as its factorization.
106457231687 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1693440, while the sum is 50.
The spelling of 106457231687 in words is "one hundred six billion, four hundred fifty-seven million, two hundred thirty-one thousand, six hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •