Base | Representation |
---|---|
bin | 110001011001110011… |
… | …0001001110100111001 |
3 | 101010211202110012111222 |
4 | 1202303212021310321 |
5 | 3214234114312424 |
6 | 120423235001425 |
7 | 10444031666204 |
oct | 1426346116471 |
9 | 333752405458 |
10 | 106092338489 |
11 | 40aa23a5195 |
12 | 1868a139275 |
13 | a009a68967 |
14 | 51c622893b |
15 | 2b5e011e5e |
hex | 18b3989d39 |
106092338489 has 2 divisors, whose sum is σ = 106092338490. Its totient is φ = 106092338488.
The previous prime is 106092338399. The next prime is 106092338497. The reversal of 106092338489 is 984833290601.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106091564089 + 774400 = 325717^2 + 880^2 .
It is a cyclic number.
It is not a de Polignac number, because 106092338489 - 216 = 106092272953 is a prime.
It is a super-2 number, since 2×1060923384892 (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 106092338489.
It is not a weakly prime, because it can be changed into another prime (106092338689) 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, 53046169244 + 53046169245.
It is an arithmetic number, because the mean of its divisors is an integer number (53046169245).
Almost surely, 2106092338489 is an apocalyptic number.
It is an amenable number.
106092338489 is a deficient number, since it is larger than the sum of its proper divisors (1).
106092338489 is an equidigital number, since it uses as much as digits as its factorization.
106092338489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2239488, while the sum is 53.
The spelling of 106092338489 in words is "one hundred six billion, ninety-two million, three hundred thirty-eight thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •