Base | Representation |
---|---|
bin | 101101001011011101110… |
… | …1001001111110100101111 |
3 | 210222121111002020001011202 |
4 | 1122112323221033310233 |
5 | 1303213300212113311 |
6 | 21112314203040115 |
7 | 1210420060153424 |
oct | 132267351176457 |
9 | 23877432201152 |
10 | 6209375894831 |
11 | 1a844218a616a |
12 | 84350351003b |
13 | 360706c80a25 |
14 | 17676d1b3d4b |
15 | ab7c05d9e3b |
hex | 5a5bba4fd2f |
6209375894831 has 2 divisors, whose sum is σ = 6209375894832. Its totient is φ = 6209375894830.
The previous prime is 6209375894797. The next prime is 6209375894879. The reversal of 6209375894831 is 1384985739026.
6209375894831 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 is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6209375894831 is a prime.
It is a super-2 number, since 2×62093758948312 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6209375894881) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3104687947415 + 3104687947416.
It is an arithmetic number, because the mean of its divisors is an integer number (3104687947416).
It is a 1-persistent number, because it is pandigital, but 2⋅6209375894831 = 12418751789662 is not.
Almost surely, 26209375894831 is an apocalyptic number.
6209375894831 is a deficient number, since it is larger than the sum of its proper divisors (1).
6209375894831 is an equidigital number, since it uses as much as digits as its factorization.
6209375894831 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78382080, while the sum is 65.
The spelling of 6209375894831 in words is "six trillion, two hundred nine billion, three hundred seventy-five million, eight hundred ninety-four thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •