Base | Representation |
---|---|
bin | 110001011110010011… |
… | …0001101010010010111 |
3 | 101011020021121021002021 |
4 | 1202330212031102113 |
5 | 3220041244110412 |
6 | 120450231354011 |
7 | 10450544361055 |
oct | 1427446152227 |
9 | 334207537067 |
10 | 106243347607 |
11 | 4106a666611 |
12 | 18710822907 |
13 | a03212bc77 |
14 | 51dc2d71d5 |
15 | 2b6c3e0607 |
hex | 18bc98d497 |
106243347607 has 2 divisors, whose sum is σ = 106243347608. Its totient is φ = 106243347606.
The previous prime is 106243347557. The next prime is 106243347629. The reversal of 106243347607 is 706743342601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 106243347607 - 27 = 106243347479 is a prime.
It is a super-2 number, since 2×1062433476072 (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 (106243377607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53121673803 + 53121673804.
It is an arithmetic number, because the mean of its divisors is an integer number (53121673804).
Almost surely, 2106243347607 is an apocalyptic number.
106243347607 is a deficient number, since it is larger than the sum of its proper divisors (1).
106243347607 is an equidigital number, since it uses as much as digits as its factorization.
106243347607 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 508032, while the sum is 43.
The spelling of 106243347607 in words is "one hundred six billion, two hundred forty-three million, three hundred forty-seven thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •