Base | Representation |
---|---|
bin | 101101010010001100111… |
… | …0001101101001110111001 |
3 | 211000222211010010101222201 |
4 | 1122210121301231032321 |
5 | 1303432411024311013 |
6 | 21123105340350201 |
7 | 1211441362511131 |
oct | 132443161551671 |
9 | 24028733111881 |
10 | 6223840072633 |
11 | 1a8a574514017 |
12 | 84627b545361 |
13 | 361ba07b1911 |
14 | 177342199ac1 |
15 | abd6a35c3dd |
hex | 5a919c6d3b9 |
6223840072633 has 2 divisors, whose sum is σ = 6223840072634. Its totient is φ = 6223840072632.
The previous prime is 6223840072627. The next prime is 6223840072649. The reversal of 6223840072633 is 3362700483226.
6223840072633 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., 4567401573904 + 1656438498729 = 2137148^2 + 1287027^2 .
It is a cyclic number.
It is not a de Polignac number, because 6223840072633 - 213 = 6223840064441 is a prime.
It is not a weakly prime, because it can be changed into another prime (6223840072613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3111920036316 + 3111920036317.
It is an arithmetic number, because the mean of its divisors is an integer number (3111920036317).
Almost surely, 26223840072633 is an apocalyptic number.
It is an amenable number.
6223840072633 is a deficient number, since it is larger than the sum of its proper divisors (1).
6223840072633 is an equidigital number, since it uses as much as digits as its factorization.
6223840072633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1741824, while the sum is 46.
The spelling of 6223840072633 in words is "six trillion, two hundred twenty-three billion, eight hundred forty million, seventy-two thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •