Base | Representation |
---|---|
bin | 1100000011001010… |
… | …00110001100100111 |
3 | 121200211110212002002 |
4 | 12001211012030213 |
5 | 101222022442441 |
6 | 2545524035515 |
7 | 316210122623 |
oct | 60145061447 |
9 | 17624425062 |
10 | 6468952871 |
11 | 281a612047 |
12 | 1306532b9b |
13 | 7c12a0384 |
14 | 455202183 |
15 | 27cdbbb9b |
hex | 181946327 |
6468952871 has 4 divisors (see below), whose sum is σ = 6578596200. Its totient is φ = 6359309544.
The previous prime is 6468952849. The next prime is 6468952873. The reversal of 6468952871 is 1782598646.
It is a happy number.
6468952871 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 6468952871 - 222 = 6464758567 is a prime.
It is a super-3 number, since 3×64689528713 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6468952873) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54821576 + ... + 54821693.
It is an arithmetic number, because the mean of its divisors is an integer number (1644649050).
Almost surely, 26468952871 is an apocalyptic number.
6468952871 is a deficient number, since it is larger than the sum of its proper divisors (109643329).
6468952871 is a wasteful number, since it uses less digits than its factorization.
6468952871 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109643328.
The product of its digits is 5806080, while the sum is 56.
The square root of 6468952871 is about 80429.8008887253. The cubic root of 6468952871 is about 1863.2794565604.
The spelling of 6468952871 in words is "six billion, four hundred sixty-eight million, nine hundred fifty-two thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •