Base | Representation |
---|---|
bin | 101101010011000101100… |
… | …0001011110010010101101 |
3 | 211001011201112020022002122 |
4 | 1122212023001132102231 |
5 | 1304000303421444044 |
6 | 21124022051202325 |
7 | 1211536433055602 |
oct | 132461301362255 |
9 | 24034645208078 |
10 | 6225740031149 |
11 | 1a90359a40a71 |
12 | 84670b8a63a5 |
13 | 3621142cc622 |
14 | 1774826526a9 |
15 | abe2c05cdee |
hex | 5a98b05e4ad |
6225740031149 has 2 divisors, whose sum is σ = 6225740031150. Its totient is φ = 6225740031148.
The previous prime is 6225740031047. The next prime is 6225740031151. The reversal of 6225740031149 is 9411300475226.
6225740031149 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5886655095049 + 339084936100 = 2426243^2 + 582310^2 .
It is a cyclic number.
It is not a de Polignac number, because 6225740031149 - 236 = 6157020554413 is a prime.
Together with 6225740031151, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6225740039149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3112870015574 + 3112870015575.
It is an arithmetic number, because the mean of its divisors is an integer number (3112870015575).
Almost surely, 26225740031149 is an apocalyptic number.
It is an amenable number.
6225740031149 is a deficient number, since it is larger than the sum of its proper divisors (1).
6225740031149 is an equidigital number, since it uses as much as digits as its factorization.
6225740031149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 44.
The spelling of 6225740031149 in words is "six trillion, two hundred twenty-five billion, seven hundred forty million, thirty-one thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •