Base | Representation |
---|---|
bin | 1100110000100000… |
… | …01101110010100001 |
3 | 122200100021021120121 |
4 | 12120100031302201 |
5 | 103011413324123 |
6 | 3051353240241 |
7 | 331506361522 |
oct | 63020156241 |
9 | 18610237517 |
10 | 6849354913 |
11 | 29a53117a5 |
12 | 13b1a03081 |
13 | 85203c53b |
14 | 48d944849 |
15 | 2a14ad75d |
hex | 19840dca1 |
6849354913 has 2 divisors, whose sum is σ = 6849354914. Its totient is φ = 6849354912.
The previous prime is 6849354881. The next prime is 6849354947. The reversal of 6849354913 is 3194539486.
It is a happy number.
6849354913 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., 4686360849 + 2162994064 = 68457^2 + 46508^2 .
It is a cyclic number.
It is not a de Polignac number, because 6849354913 - 25 = 6849354881 is a prime.
It is not a weakly prime, because it can be changed into another prime (6849354313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3424677456 + 3424677457.
It is an arithmetic number, because the mean of its divisors is an integer number (3424677457).
Almost surely, 26849354913 is an apocalyptic number.
It is an amenable number.
6849354913 is a deficient number, since it is larger than the sum of its proper divisors (1).
6849354913 is an equidigital number, since it uses as much as digits as its factorization.
6849354913 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2799360, while the sum is 52.
The square root of 6849354913 is about 82760.8295813907. The cubic root of 6849354913 is about 1899.1089924755.
The spelling of 6849354913 in words is "six billion, eight hundred forty-nine million, three hundred fifty-four thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •