Base | Representation |
---|---|
bin | 1011010111101101… |
… | …00001100001000001 |
3 | 120202102112210100221 |
4 | 11223312201201001 |
5 | 100000213004330 |
6 | 2445422543041 |
7 | 304162510021 |
oct | 55366414101 |
9 | 16672483327 |
10 | 6104422465 |
11 | 2652872a49 |
12 | 1224437a81 |
13 | 7638ca4cb |
14 | 41ca31a81 |
15 | 25adb2b7a |
hex | 16bda1841 |
6104422465 has 4 divisors (see below), whose sum is σ = 7325306964. Its totient is φ = 4883537968.
The previous prime is 6104422447. The next prime is 6104422529. The reversal of 6104422465 is 5642244016.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3525509376 + 2578913089 = 59376^2 + 50783^2 .
It is a cyclic number.
It is not a de Polignac number, because 6104422465 - 211 = 6104420417 is a prime.
It is a super-3 number, since 3×61044224653 (a number of 30 digits) contains 333 as substring.
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 6104422465.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 610442242 + ... + 610442251.
It is an arithmetic number, because the mean of its divisors is an integer number (1831326741).
Almost surely, 26104422465 is an apocalyptic number.
It is an amenable number.
6104422465 is a deficient number, since it is larger than the sum of its proper divisors (1220884499).
6104422465 is a wasteful number, since it uses less digits than its factorization.
6104422465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1220884498.
The product of its (nonzero) digits is 46080, while the sum is 34.
The square root of 6104422465 is about 78130.8035604396. The cubic root of 6104422465 is about 1827.6015904021.
The spelling of 6104422465 in words is "six billion, one hundred four million, four hundred twenty-two thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •