Base | Representation |
---|---|
bin | 101110000101101101000… |
… | …0101101110111000101101 |
3 | 211102120022001202221120202 |
4 | 1130023122011232320231 |
5 | 1312240413311331112 |
6 | 21250000224323245 |
7 | 1222435226546531 |
oct | 134133205567055 |
9 | 24376261687522 |
10 | 6334440730157 |
11 | 202246a721001 |
12 | 8637a7473525 |
13 | 36c448577777 |
14 | 17c835057bc1 |
15 | aeb900526c2 |
hex | 5c2da16ee2d |
6334440730157 has 4 divisors (see below), whose sum is σ = 6538777527936. Its totient is φ = 6130103932380.
The previous prime is 6334440730129. The next prime is 6334440730159. The reversal of 6334440730157 is 7510370444336.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 6334440730157 - 28 = 6334440729901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6334440730159) 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 3 ways as a sum of consecutive naturals, for example, 102168398843 + ... + 102168398904.
It is an arithmetic number, because the mean of its divisors is an integer number (1634694381984).
Almost surely, 26334440730157 is an apocalyptic number.
It is an amenable number.
6334440730157 is a deficient number, since it is larger than the sum of its proper divisors (204336797779).
6334440730157 is a wasteful number, since it uses less digits than its factorization.
6334440730157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204336797778.
The product of its (nonzero) digits is 2540160, while the sum is 47.
The spelling of 6334440730157 in words is "six trillion, three hundred thirty-four billion, four hundred forty million, seven hundred thirty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •