Base | Representation |
---|---|
bin | 1100011111011110… |
… | …01111011001100101 |
3 | 122022101110010220201 |
4 | 12033233033121211 |
5 | 102213330234104 |
6 | 3025251230501 |
7 | 325123151545 |
oct | 61757173145 |
9 | 18271403821 |
10 | 6706493029 |
11 | 2931705525 |
12 | 1371ba8431 |
13 | 82b56c692 |
14 | 478997325 |
15 | 293b8e0a4 |
hex | 18fbcf665 |
6706493029 has 2 divisors, whose sum is σ = 6706493030. Its totient is φ = 6706493028.
The previous prime is 6706492999. The next prime is 6706493033. The reversal of 6706493029 is 9203946076.
6706493029 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6687150625 + 19342404 = 81775^2 + 4398^2 .
It is a cyclic number.
It is not a de Polignac number, because 6706493029 - 29 = 6706492517 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6706493029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6706493929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3353246514 + 3353246515.
It is an arithmetic number, because the mean of its divisors is an integer number (3353246515).
Almost surely, 26706493029 is an apocalyptic number.
It is an amenable number.
6706493029 is a deficient number, since it is larger than the sum of its proper divisors (1).
6706493029 is an equidigital number, since it uses as much as digits as its factorization.
6706493029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 489888, while the sum is 46.
The square root of 6706493029 is about 81893.1806013175. The cubic root of 6706493029 is about 1885.8124235479.
The spelling of 6706493029 in words is "six billion, seven hundred six million, four hundred ninety-three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •