Base | Representation |
---|---|
bin | 1001101101100111000110110… |
… | …1001011000010001011000111 |
3 | 10022121221221211121011102200122 |
4 | 2123121301231023002023013 |
5 | 1204040422111220343403 |
6 | 10421341043021132155 |
7 | 263650655146433114 |
oct | 23331615513021307 |
9 | 3277857747142618 |
10 | 683468567356103 |
11 | 188857434313701 |
12 | 647a49543ba05b |
13 | 23449a6a1b6719 |
14 | c0ac0ab52590b |
15 | 54038bc6b2838 |
hex | 26d9c6d2c22c7 |
683468567356103 has 2 divisors, whose sum is σ = 683468567356104. Its totient is φ = 683468567356102.
The previous prime is 683468567356067. The next prime is 683468567356241. The reversal of 683468567356103 is 301653765864386.
683468567356103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 683468567356103 - 216 = 683468567290567 is a prime.
It is a super-2 number, since 2×6834685673561032 (a number of 30 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (683468527356103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 341734283678051 + 341734283678052.
It is an arithmetic number, because the mean of its divisors is an integer number (341734283678052).
Almost surely, 2683468567356103 is an apocalyptic number.
683468567356103 is a deficient number, since it is larger than the sum of its proper divisors (1).
683468567356103 is an equidigital number, since it uses as much as digits as its factorization.
683468567356103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1567641600, while the sum is 71.
The spelling of 683468567356103 in words is "six hundred eighty-three trillion, four hundred sixty-eight billion, five hundred sixty-seven million, three hundred fifty-six thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •