Base | Representation |
---|---|
bin | 1100111010111100… |
… | …10010101000100101 |
3 | 122220110001121011221 |
4 | 12131132102220211 |
5 | 103201323241403 |
6 | 3104202300341 |
7 | 333621640126 |
oct | 63536225045 |
9 | 18813047157 |
10 | 6936930853 |
11 | 2a3a797906 |
12 | 14171b76b1 |
13 | 867223018 |
14 | 49b42004d |
15 | 2a900bdbd |
hex | 19d792a25 |
6936930853 has 8 divisors (see below), whose sum is σ = 7179411456. Its totient is φ = 6695619600.
The previous prime is 6936930787. The next prime is 6936930857. The reversal of 6936930853 is 3580396396.
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 6936930853 - 213 = 6936922661 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6936930853.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6936930857) 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, 280258 + ... + 304003.
It is an arithmetic number, because the mean of its divisors is an integer number (897426432).
Almost surely, 26936930853 is an apocalyptic number.
It is an amenable number.
6936930853 is a deficient number, since it is larger than the sum of its proper divisors (242480603).
6936930853 is a wasteful number, since it uses less digits than its factorization.
6936930853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 584675.
The product of its (nonzero) digits is 3149280, while the sum is 52.
The square root of 6936930853 is about 83288.2395839893. The cubic root of 6936930853 is about 1907.1687494066.
The spelling of 6936930853 in words is "six billion, nine hundred thirty-six million, nine hundred thirty thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •