Base | Representation |
---|---|
bin | 1100010110111101… |
… | …11100111101100101 |
3 | 122010102010201202121 |
4 | 12023132330331211 |
5 | 102042042124331 |
6 | 3014221305541 |
7 | 323265353452 |
oct | 61336747545 |
9 | 18112121677 |
10 | 6635114341 |
11 | 28a5392679 |
12 | 13521052b1 |
13 | 81983a47b |
14 | 46d2d6829 |
15 | 28c78ec11 |
hex | 18b7bcf65 |
6635114341 has 2 divisors, whose sum is σ = 6635114342. Its totient is φ = 6635114340.
The previous prime is 6635114303. The next prime is 6635114443. The reversal of 6635114341 is 1434115366.
6635114341 is digitally balanced in base 3, 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., 6424022500 + 211091841 = 80150^2 + 14529^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6635114341 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6635114297 and 6635114306.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6635114041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3317557170 + 3317557171.
It is an arithmetic number, because the mean of its divisors is an integer number (3317557171).
Almost surely, 26635114341 is an apocalyptic number.
It is an amenable number.
6635114341 is a deficient number, since it is larger than the sum of its proper divisors (1).
6635114341 is an equidigital number, since it uses as much as digits as its factorization.
6635114341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25920, while the sum is 34.
The square root of 6635114341 is about 81456.2111873613. The cubic root of 6635114341 is about 1879.0981736432.
The spelling of 6635114341 in words is "six billion, six hundred thirty-five million, one hundred fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •