Base | Representation |
---|---|
bin | 10010100001101111… |
… | …01000010110011011 |
3 | 221200012110110111121 |
4 | 21100313220112123 |
5 | 130332323220232 |
6 | 4323000110111 |
7 | 501326340661 |
oct | 112067502633 |
9 | 27605413447 |
10 | 9946695067 |
11 | 4244717251 |
12 | 1b17165337 |
13 | c269459aa |
14 | 6a5048c31 |
15 | 3d337dd97 |
hex | 250de859b |
9946695067 has 2 divisors, whose sum is σ = 9946695068. Its totient is φ = 9946695066.
The previous prime is 9946695049. The next prime is 9946695071. The reversal of 9946695067 is 7605966499.
9946695067 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9946695067 is a prime.
It is a super-3 number, since 3×99466950673 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 9946694996 and 9946695014.
It is not a weakly prime, because it can be changed into another prime (9946695037) 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 as a sum of consecutive naturals, namely, 4973347533 + 4973347534.
It is an arithmetic number, because the mean of its divisors is an integer number (4973347534).
Almost surely, 29946695067 is an apocalyptic number.
9946695067 is a deficient number, since it is larger than the sum of its proper divisors (1).
9946695067 is an equidigital number, since it uses as much as digits as its factorization.
9946695067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22044960, while the sum is 61.
The square root of 9946695067 is about 99733.1192082149. The cubic root of 9946695067 is about 2150.5998014293.
The spelling of 9946695067 in words is "nine billion, nine hundred forty-six million, six hundred ninety-five thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •