Base | Representation |
---|---|
bin | 101111001101110001111… |
… | …0100101100111011000101 |
3 | 211222100211002122212000101 |
4 | 1132123203310230323011 |
5 | 1322304412023013420 |
6 | 21445035142444101 |
7 | 1236554664133651 |
oct | 136334364547305 |
9 | 24870732585011 |
10 | 6489222860485 |
11 | 2082078149482 |
12 | 8897a3733631 |
13 | 380c147b2931 |
14 | 186119995a61 |
15 | b3bed89e60a |
hex | 5e6e3d2cec5 |
6489222860485 has 4 divisors (see below), whose sum is σ = 7787067432588. Its totient is φ = 5191378288384.
The previous prime is 6489222860411. The next prime is 6489222860503. The reversal of 6489222860485 is 5840682229846.
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 1243505995876 + 5245716864609 = 1115126^2 + 2290353^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6489222860485 is a prime.
It is a super-2 number, since 2×64892228604852 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
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, 648922286044 + ... + 648922286053.
It is an arithmetic number, because the mean of its divisors is an integer number (1946766858147).
Almost surely, 26489222860485 is an apocalyptic number.
It is an amenable number.
6489222860485 is a deficient number, since it is larger than the sum of its proper divisors (1297844572103).
6489222860485 is a wasteful number, since it uses less digits than its factorization.
6489222860485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1297844572102.
The product of its (nonzero) digits is 106168320, while the sum is 64.
The spelling of 6489222860485 in words is "six trillion, four hundred eighty-nine billion, two hundred twenty-two million, eight hundred sixty thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •