Base | Representation |
---|---|
bin | 1100011001101111000… |
… | …0111111000010001001 |
3 | 202100221222121011212112 |
4 | 3012123300333002021 |
5 | 11442330034111311 |
6 | 241514222552105 |
7 | 21251664061634 |
oct | 3063360770211 |
9 | 670858534775 |
10 | 213066707081 |
11 | 823a7668678 |
12 | 35363738635 |
13 | 17127478907 |
14 | a453652c1b |
15 | 58206a128b |
hex | 319bc3f089 |
213066707081 has 2 divisors, whose sum is σ = 213066707082. Its totient is φ = 213066707080.
The previous prime is 213066707027. The next prime is 213066707101. The reversal of 213066707081 is 180707660312.
213066707081 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 can be written as a sum of positive squares in only one way, i.e., 212110908025 + 955799056 = 460555^2 + 30916^2 .
It is a cyclic number.
It is not a de Polignac number, because 213066707081 - 26 = 213066707017 is a prime.
It is a super-2 number, since 2×2130667070812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (213066707281) 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, 106533353540 + 106533353541.
It is an arithmetic number, because the mean of its divisors is an integer number (106533353541).
Almost surely, 2213066707081 is an apocalyptic number.
It is an amenable number.
213066707081 is a deficient number, since it is larger than the sum of its proper divisors (1).
213066707081 is an equidigital number, since it uses as much as digits as its factorization.
213066707081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84672, while the sum is 41.
The spelling of 213066707081 in words is "two hundred thirteen billion, sixty-six million, seven hundred seven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •