Base | Representation |
---|---|
bin | 1100101110111010… |
… | …01101000000101101 |
3 | 122122102002212220122 |
4 | 12113131031000231 |
5 | 103000002414011 |
6 | 3050154454325 |
7 | 331254614534 |
oct | 62735150055 |
9 | 18572085818 |
10 | 6835982381 |
11 | 2998808818 |
12 | 13a94343a5 |
13 | 84c3398b7 |
14 | 48bc6331b |
15 | 2a021b3db |
hex | 19774d02d |
6835982381 has 2 divisors, whose sum is σ = 6835982382. Its totient is φ = 6835982380.
The previous prime is 6835982371. The next prime is 6835982437. The reversal of 6835982381 is 1832895386.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6230576356 + 605406025 = 78934^2 + 24605^2 .
It is a cyclic number.
It is not a de Polignac number, because 6835982381 - 210 = 6835981357 is a prime.
It is a super-2 number, since 2×68359823812 = 93461310226684858322, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6835982371) 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, 3417991190 + 3417991191.
It is an arithmetic number, because the mean of its divisors is an integer number (3417991191).
Almost surely, 26835982381 is an apocalyptic number.
It is an amenable number.
6835982381 is a deficient number, since it is larger than the sum of its proper divisors (1).
6835982381 is an equidigital number, since it uses as much as digits as its factorization.
6835982381 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2488320, while the sum is 53.
The square root of 6835982381 is about 82679.9998850992. Note that the first 3 decimals coincide. The cubic root of 6835982381 is about 1897.8722608654.
The spelling of 6835982381 in words is "six billion, eight hundred thirty-five million, nine hundred eighty-two thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •