Base | Representation |
---|---|
bin | 1100011101011100… |
… | …01101001001100101 |
3 | 122021012100222122222 |
4 | 12032232031021211 |
5 | 102144444210303 |
6 | 3023442002125 |
7 | 324525224336 |
oct | 61656151145 |
9 | 18235328588 |
10 | 6689444453 |
11 | 292302069a |
12 | 1368346345 |
13 | 827b80773 |
14 | 4765da28d |
15 | 292422938 |
hex | 18eb8d265 |
6689444453 has 8 divisors (see below), whose sum is σ = 6988234176. Its totient is φ = 6391316800.
The previous prime is 6689444401. The next prime is 6689444459. The reversal of 6689444453 is 3544449866.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6689444453 - 210 = 6689443429 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6689444395 and 6689444404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6689444459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 144803 + ... + 185328.
It is an arithmetic number, because the mean of its divisors is an integer number (873529272).
Almost surely, 26689444453 is an apocalyptic number.
It is an amenable number.
6689444453 is a deficient number, since it is larger than the sum of its proper divisors (298789723).
6689444453 is a wasteful number, since it uses less digits than its factorization.
6689444453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331035.
The product of its digits is 9953280, while the sum is 53.
The square root of 6689444453 is about 81789.0240374587. The cubic root of 6689444453 is about 1884.2130929679.
The spelling of 6689444453 in words is "six billion, six hundred eighty-nine million, four hundred forty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •