Base | Representation |
---|---|
bin | 110000000100001011… |
… | …1010001111101001101 |
3 | 100212102112202200221102 |
4 | 1200020113101331031 |
5 | 3142343200120233 |
6 | 115230212512445 |
7 | 10312606401641 |
oct | 1401027217515 |
9 | 325375680842 |
10 | 103219535693 |
11 | 3a8588119aa |
12 | 1800801b725 |
13 | 996c82b251 |
14 | 4dd2892c21 |
15 | 2a41be61e8 |
hex | 18085d1f4d |
103219535693 has 2 divisors, whose sum is σ = 103219535694. Its totient is φ = 103219535692.
The previous prime is 103219535633. The next prime is 103219535707. The reversal of 103219535693 is 396535912301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 58562548009 + 44656987684 = 241997^2 + 211322^2 .
It is a cyclic number.
It is not a de Polignac number, because 103219535693 - 28 = 103219535437 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103219535633) 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, 51609767846 + 51609767847.
It is an arithmetic number, because the mean of its divisors is an integer number (51609767847).
Almost surely, 2103219535693 is an apocalyptic number.
It is an amenable number.
103219535693 is a deficient number, since it is larger than the sum of its proper divisors (1).
103219535693 is an equidigital number, since it uses as much as digits as its factorization.
103219535693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 656100, while the sum is 47.
The spelling of 103219535693 in words is "one hundred three billion, two hundred nineteen million, five hundred thirty-five thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •