Base | Representation |
---|---|
bin | 10011111010111011… |
… | …10001000000010101 |
3 | 1000121100022200022021 |
4 | 21331131301000111 |
5 | 133400342430433 |
6 | 4525124333141 |
7 | 526013026561 |
oct | 117535610025 |
9 | 30540280267 |
10 | 10694889493 |
11 | 4598a93852 |
12 | 20a58441b1 |
13 | 101595a6a2 |
14 | 73656a6a1 |
15 | 428dc122d |
hex | 27d771015 |
10694889493 has 2 divisors, whose sum is σ = 10694889494. Its totient is φ = 10694889492.
The previous prime is 10694889487. The next prime is 10694889509. The reversal of 10694889493 is 39498849601.
10694889493 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6092895249 + 4601994244 = 78057^2 + 67838^2 .
It is a cyclic number.
It is not a de Polignac number, because 10694889493 - 229 = 10158018581 is a prime.
It is a super-2 number, since 2×106948894932 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10694884493) 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, 5347444746 + 5347444747.
It is an arithmetic number, because the mean of its divisors is an integer number (5347444747).
Almost surely, 210694889493 is an apocalyptic number.
It is an amenable number.
10694889493 is a deficient number, since it is larger than the sum of its proper divisors (1).
10694889493 is an equidigital number, since it uses as much as digits as its factorization.
10694889493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13436928, while the sum is 61.
The spelling of 10694889493 in words is "ten billion, six hundred ninety-four million, eight hundred eighty-nine thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •