Base | Representation |
---|---|
bin | 1100000011000011… |
… | …01001100001101001 |
3 | 121200202202221012102 |
4 | 12001201221201221 |
5 | 101221310032001 |
6 | 2545452423145 |
7 | 316166336501 |
oct | 60141514151 |
9 | 17622687172 |
10 | 6468049001 |
11 | 281a054a47 |
12 | 1306177ab5 |
13 | 7c1044b3b |
14 | 455048a01 |
15 | 27cc8de6b |
hex | 181869869 |
6468049001 has 4 divisors (see below), whose sum is σ = 6473014272. Its totient is φ = 6463083732.
The previous prime is 6468048941. The next prime is 6468049019. The reversal of 6468049001 is 1009408646.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1009408646 = 2 ⋅504704323.
It is a cyclic number.
It is not a de Polignac number, because 6468049001 - 214 = 6468032617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6468049201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2480681 + ... + 2483286.
It is an arithmetic number, because the mean of its divisors is an integer number (1618253568).
Almost surely, 26468049001 is an apocalyptic number.
It is an amenable number.
6468049001 is a deficient number, since it is larger than the sum of its proper divisors (4965271).
6468049001 is a wasteful number, since it uses less digits than its factorization.
6468049001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4965270.
The product of its (nonzero) digits is 41472, while the sum is 38.
The square root of 6468049001 is about 80424.1816930704. The cubic root of 6468049001 is about 1863.1926707038.
The spelling of 6468049001 in words is "six billion, four hundred sixty-eight million, forty-nine thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •