Base | Representation |
---|---|
bin | 1100011101100000… |
… | …10100111110011111 |
3 | 122021020102020211101 |
4 | 12032300110332133 |
5 | 102200120011144 |
6 | 3023501533531 |
7 | 324533032336 |
oct | 61660247637 |
9 | 18236366741 |
10 | 6690000799 |
11 | 2923370689 |
12 | 13685742a7 |
13 | 828016a71 |
14 | 476702d1d |
15 | 2924d26d4 |
hex | 18ec14f9f |
6690000799 has 2 divisors, whose sum is σ = 6690000800. Its totient is φ = 6690000798.
The previous prime is 6690000797. The next prime is 6690000883. The reversal of 6690000799 is 9970000966.
6690000799 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 6690000799 - 21 = 6690000797 is a prime.
It is a super-2 number, since 2×66900007992 = 89512221381241276802, which contains 22 as substring.
Together with 6690000797, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6690000797) 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 as a sum of consecutive naturals, namely, 3345000399 + 3345000400.
It is an arithmetic number, because the mean of its divisors is an integer number (3345000400).
Almost surely, 26690000799 is an apocalyptic number.
6690000799 is a deficient number, since it is larger than the sum of its proper divisors (1).
6690000799 is an equidigital number, since it uses as much as digits as its factorization.
6690000799 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 183708, while the sum is 46.
The square root of 6690000799 is about 81792.4250710297. The cubic root of 6690000799 is about 1884.2653267703.
The spelling of 6690000799 in words is "six billion, six hundred ninety million, seven hundred ninety-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •