Base | Representation |
---|---|
bin | 1011001111100110… |
… | …01011111010000101 |
3 | 120120200121212010021 |
4 | 11213303023322011 |
5 | 44330312014121 |
6 | 2434553455141 |
7 | 302405611351 |
oct | 54763137205 |
9 | 16520555107 |
10 | 6036438661 |
11 | 2618459790 |
12 | 12057114b1 |
13 | 7527b65c6 |
14 | 4139b6461 |
15 | 254e34641 |
hex | 167ccbe85 |
6036438661 has 8 divisors (see below), whose sum is σ = 6595486848. Its totient is φ = 5479104000.
The previous prime is 6036438623. The next prime is 6036438679. The reversal of 6036438661 is 1668346306.
6036438661 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6036438661 - 27 = 6036438533 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 (6036438601) 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 in 7 ways as a sum of consecutive naturals, for example, 421005 + ... + 435106.
It is an arithmetic number, because the mean of its divisors is an integer number (824435856).
Almost surely, 26036438661 is an apocalyptic number.
It is an amenable number.
6036438661 is a deficient number, since it is larger than the sum of its proper divisors (559048187).
6036438661 is a wasteful number, since it uses less digits than its factorization.
6036438661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 856763.
The product of its (nonzero) digits is 373248, while the sum is 43.
The square root of 6036438661 is about 77694.5214349120. The cubic root of 6036438661 is about 1820.7916956762.
The spelling of 6036438661 in words is "six billion, thirty-six million, four hundred thirty-eight thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •