Base | Representation |
---|---|
bin | 110010011101110111101… |
… | …100010001001101000001 |
3 | 110021112122010201020100002 |
4 | 302131313230101031001 |
5 | 423310024423421002 |
6 | 11213110524405345 |
7 | 505362300401426 |
oct | 62356754211501 |
9 | 13245563636302 |
10 | 3468046701377 |
11 | 1117876a50a65 |
12 | 4801699a6855 |
13 | 1c205ca1038b |
14 | bdbd64d1d4d |
15 | 6032a013002 |
hex | 32777b11341 |
3468046701377 has 2 divisors, whose sum is σ = 3468046701378. Its totient is φ = 3468046701376.
The previous prime is 3468046701359. The next prime is 3468046701463. The reversal of 3468046701377 is 7731076408643.
3468046701377 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 can be written as a sum of positive squares in only one way, i.e., 2340168717121 + 1127877984256 = 1529761^2 + 1062016^2 .
It is a cyclic number.
It is not a de Polignac number, because 3468046701377 - 230 = 3466972959553 is a prime.
It is a super-2 number, since 2×34680467013772 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3468046701677) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1734023350688 + 1734023350689.
It is an arithmetic number, because the mean of its divisors is an integer number (1734023350689).
Almost surely, 23468046701377 is an apocalyptic number.
It is an amenable number.
3468046701377 is a deficient number, since it is larger than the sum of its proper divisors (1).
3468046701377 is an equidigital number, since it uses as much as digits as its factorization.
3468046701377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14224896, while the sum is 56.
The spelling of 3468046701377 in words is "three trillion, four hundred sixty-eight billion, forty-six million, seven hundred one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •