Base | Representation |
---|---|
bin | 1100110010111011… |
… | …11111100000100101 |
3 | 122201202122010200010 |
4 | 12121131333200211 |
5 | 103032123244103 |
6 | 3053402240433 |
7 | 332144600103 |
oct | 63135774045 |
9 | 18652563603 |
10 | 6869743653 |
11 | 2a058780a3 |
12 | 13b87b6119 |
13 | 85632a896 |
14 | 492530c73 |
15 | 2a3189903 |
hex | 19977f825 |
6869743653 has 8 divisors (see below), whose sum is σ = 9218000608. Its totient is φ = 4550657904.
The previous prime is 6869743649. The next prime is 6869743669. The reversal of 6869743653 is 3563479686.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6869743653 - 22 = 6869743649 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6869743593 and 6869743602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6869743633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7292251 + ... + 7293192.
It is an arithmetic number, because the mean of its divisors is an integer number (1152250076).
Almost surely, 26869743653 is an apocalyptic number.
It is an amenable number.
6869743653 is a deficient number, since it is larger than the sum of its proper divisors (2348256955).
6869743653 is a wasteful number, since it uses less digits than its factorization.
6869743653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14585603.
The product of its digits is 19595520, while the sum is 57.
The square root of 6869743653 is about 82883.9167329826. The cubic root of 6869743653 is about 1900.9915095481.
The spelling of 6869743653 in words is "six billion, eight hundred sixty-nine million, seven hundred forty-three thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •