Base | Representation |
---|---|
bin | 1100100110110101… |
… | …10000001111100101 |
3 | 122110200121210000221 |
4 | 12103122300033211 |
5 | 102330131401042 |
6 | 3035334404341 |
7 | 326503006024 |
oct | 62332601745 |
9 | 18420553027 |
10 | 6768231397 |
11 | 2963543474 |
12 | 138a8006b1 |
13 | 83b2a7965 |
14 | 482c688bb |
15 | 2992d6d67 |
hex | 1936b03e5 |
6768231397 has 2 divisors, whose sum is σ = 6768231398. Its totient is φ = 6768231396.
The previous prime is 6768231383. The next prime is 6768231419. The reversal of 6768231397 is 7931328676.
It is a happy number.
6768231397 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., 5023832641 + 1744398756 = 70879^2 + 41766^2 .
It is a cyclic number.
It is not a de Polignac number, because 6768231397 - 27 = 6768231269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6768231317) 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, 3384115698 + 3384115699.
It is an arithmetic number, because the mean of its divisors is an integer number (3384115699).
Almost surely, 26768231397 is an apocalyptic number.
It is an amenable number.
6768231397 is a deficient number, since it is larger than the sum of its proper divisors (1).
6768231397 is an equidigital number, since it uses as much as digits as its factorization.
6768231397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2286144, while the sum is 52.
The square root of 6768231397 is about 82269.2615561851. The cubic root of 6768231397 is about 1891.5815356912.
The spelling of 6768231397 in words is "six billion, seven hundred sixty-eight million, two hundred thirty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •