Base | Representation |
---|---|
bin | 101101110110010101010… |
… | …0101000110010110110101 |
3 | 211022102002120212210212121 |
4 | 1123230222211012112311 |
5 | 1311220312414013134 |
6 | 21222500531515541 |
7 | 1220156226032221 |
oct | 133545245062665 |
9 | 24272076783777 |
10 | 6301431391669 |
11 | 200a470819477 |
12 | 859314758bb1 |
13 | 3692b78ab70b |
14 | 17adc3095781 |
15 | addac13cab4 |
hex | 5bb2a9465b5 |
6301431391669 has 2 divisors, whose sum is σ = 6301431391670. Its totient is φ = 6301431391668.
The previous prime is 6301431391627. The next prime is 6301431391733. The reversal of 6301431391669 is 9661931341036.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5949272226769 + 352159164900 = 2439113^2 + 593430^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6301431391669 is a prime.
It is a super-2 number, since 2×63014313916692 (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 (6301431394669) 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, 3150715695834 + 3150715695835.
It is an arithmetic number, because the mean of its divisors is an integer number (3150715695835).
Almost surely, 26301431391669 is an apocalyptic number.
It is an amenable number.
6301431391669 is a deficient number, since it is larger than the sum of its proper divisors (1).
6301431391669 is an equidigital number, since it uses as much as digits as its factorization.
6301431391669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1889568, while the sum is 52.
The spelling of 6301431391669 in words is "six trillion, three hundred one billion, four hundred thirty-one million, three hundred ninety-one thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •