Base | Representation |
---|---|
bin | 101110110000001011101… |
… | …0000001101101111010111 |
3 | 211202021202101012000110111 |
4 | 1131200113100031233113 |
5 | 1320234223231420432 |
6 | 21355524043503451 |
7 | 1232144606012302 |
oct | 135402720155727 |
9 | 24667671160414 |
10 | 6425661201367 |
11 | 2058120260191 |
12 | 879404b27b87 |
13 | 377c251aac55 |
14 | 18300a093b39 |
15 | b222d610347 |
hex | 5d81740dbd7 |
6425661201367 has 8 divisors (see below), whose sum is σ = 6492822890400. Its totient is φ = 6358518242304.
The previous prime is 6425661201313. The next prime is 6425661201403. The reversal of 6425661201367 is 7631021665246.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6425661201367 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6425661201367.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6425661201667) 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 in 7 ways as a sum of consecutive naturals, for example, 3992242 + ... + 5365567.
It is an arithmetic number, because the mean of its divisors is an integer number (811602861300).
Almost surely, 26425661201367 is an apocalyptic number.
6425661201367 is a deficient number, since it is larger than the sum of its proper divisors (67161689033).
6425661201367 is an equidigital number, since it uses as much as digits as its factorization.
6425661201367 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9364985.
The product of its (nonzero) digits is 2177280, while the sum is 49.
The spelling of 6425661201367 in words is "six trillion, four hundred twenty-five billion, six hundred sixty-one million, two hundred one thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •