Base | Representation |
---|---|
bin | 101100000111111110001… |
… | …1010010100100100000101 |
3 | 210110202100210202020101121 |
4 | 1120033330122110210011 |
5 | 1243324430001104221 |
6 | 20521543510553541 |
7 | 1164066214121365 |
oct | 130177432244405 |
9 | 23422323666347 |
10 | 6064433613061 |
11 | 1a28a0374763a |
12 | 81b3b26688b1 |
13 | 34cb484bb665 |
14 | 16d73d42a9a5 |
15 | a7b3aa63a41 |
hex | 583fc694905 |
6064433613061 has 8 divisors (see below), whose sum is σ = 6119786433600. Its totient is φ = 6009248275680.
The previous prime is 6064433612999. The next prime is 6064433613103. The reversal of 6064433613061 is 1603163344606.
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 6064433613061 - 27 = 6064433612933 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6064433612999 and 6064433613017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6064433616061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41798041 + ... + 41942878.
It is an arithmetic number, because the mean of its divisors is an integer number (764973304200).
Almost surely, 26064433613061 is an apocalyptic number.
It is an amenable number.
6064433613061 is a deficient number, since it is larger than the sum of its proper divisors (55352820539).
6064433613061 is a wasteful number, since it uses less digits than its factorization.
6064433613061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83741579.
The product of its (nonzero) digits is 559872, while the sum is 43.
Adding to 6064433613061 its reverse (1603163344606), we get a palindrome (7667596957667).
The spelling of 6064433613061 in words is "six trillion, sixty-four billion, four hundred thirty-three million, six hundred thirteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •