Base | Representation |
---|---|
bin | 1100100000011001… |
… | …00000110010110011 |
3 | 122022220212222212112 |
4 | 12100030200302303 |
5 | 102222311311301 |
6 | 3030123515535 |
7 | 325245321206 |
oct | 62014406263 |
9 | 18286788775 |
10 | 6714166451 |
11 | 2935a766a3 |
12 | 1374688bab |
13 | 830028275 |
14 | 4799d393d |
15 | 2946a79bb |
hex | 190320cb3 |
6714166451 has 4 divisors (see below), whose sum is σ = 6714380304. Its totient is φ = 6713952600.
The previous prime is 6714166427. The next prime is 6714166453. The reversal of 6714166451 is 1546614176.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6714166451 is a prime.
It is a super-2 number, since 2×67141664512 = 90160062263467870802, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6714166399 and 6714166408.
It is not an unprimeable number, because it can be changed into a prime (6714166453) 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, 49580 + ... + 126041.
It is an arithmetic number, because the mean of its divisors is an integer number (1678595076).
Almost surely, 26714166451 is an apocalyptic number.
6714166451 is a deficient number, since it is larger than the sum of its proper divisors (213853).
6714166451 is a wasteful number, since it uses less digits than its factorization.
6714166451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213852.
The product of its digits is 120960, while the sum is 41.
The square root of 6714166451 is about 81940.0173968739. The cubic root of 6714166451 is about 1886.5313844607.
The spelling of 6714166451 in words is "six billion, seven hundred fourteen million, one hundred sixty-six thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •