Base | Representation |
---|---|
bin | 110001110010000101… |
… | …0111001110010011101 |
3 | 101012221112220110001002 |
4 | 1203210022321302131 |
5 | 3222421230402433 |
6 | 121040150000045 |
7 | 10503155605451 |
oct | 1434412716235 |
9 | 335845813032 |
10 | 106907278493 |
11 | 4138040a724 |
12 | 18877046025 |
13 | a10984ca92 |
14 | 5262562661 |
15 | 2baa83a9e8 |
hex | 18e42b9c9d |
106907278493 has 2 divisors, whose sum is σ = 106907278494. Its totient is φ = 106907278492.
The previous prime is 106907278459. The next prime is 106907278523. The reversal of 106907278493 is 394872709601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73387893604 + 33519384889 = 270902^2 + 183083^2 .
It is an emirp because it is prime and its reverse (394872709601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106907278493 - 28 = 106907278237 is a prime.
It is a super-2 number, since 2×1069072784932 (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 (106907218493) 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, 53453639246 + 53453639247.
It is an arithmetic number, because the mean of its divisors is an integer number (53453639247).
Almost surely, 2106907278493 is an apocalyptic number.
It is an amenable number.
106907278493 is a deficient number, since it is larger than the sum of its proper divisors (1).
106907278493 is an equidigital number, since it uses as much as digits as its factorization.
106907278493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4572288, while the sum is 56.
The spelling of 106907278493 in words is "one hundred six billion, nine hundred seven million, two hundred seventy-eight thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •