Base | Representation |
---|---|
bin | 110000010000000011011… |
… | …1001110100111100110001 |
3 | 212110222011210111021110001 |
4 | 1200200012321310330301 |
5 | 1332122401100434114 |
6 | 22034253451110001 |
7 | 1253053606136602 |
oct | 140400671647461 |
9 | 25428153437401 |
10 | 6631545327409 |
11 | 21274714a9372 |
12 | 8b12a3142301 |
13 | 391476584cc2 |
14 | 18cd7b81dda9 |
15 | b777d42e374 |
hex | 60806e74f31 |
6631545327409 has 2 divisors, whose sum is σ = 6631545327410. Its totient is φ = 6631545327408.
The previous prime is 6631545327397. The next prime is 6631545327479. The reversal of 6631545327409 is 9047235451366.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4437354889009 + 2194190438400 = 2106503^2 + 1481280^2 .
It is a cyclic number.
It is not a de Polignac number, because 6631545327409 - 25 = 6631545327377 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6631545327409.
It is not a weakly prime, because it can be changed into another prime (6631545327479) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3315772663704 + 3315772663705.
It is an arithmetic number, because the mean of its divisors is an integer number (3315772663705).
Almost surely, 26631545327409 is an apocalyptic number.
It is an amenable number.
6631545327409 is a deficient number, since it is larger than the sum of its proper divisors (1).
6631545327409 is an equidigital number, since it uses as much as digits as its factorization.
6631545327409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16329600, while the sum is 55.
The spelling of 6631545327409 in words is "six trillion, six hundred thirty-one billion, five hundred forty-five million, three hundred twenty-seven thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •