Base | Representation |
---|---|
bin | 11001011010000… |
… | …01101101010101 |
3 | 112212001010111021 |
4 | 30231001231111 |
5 | 414030130234 |
6 | 33052041141 |
7 | 5165401315 |
oct | 1455015525 |
9 | 485033437 |
10 | 213130069 |
11 | aa340859 |
12 | 5b4631b1 |
13 | 35203789 |
14 | 2043d445 |
15 | 13a9e9b4 |
hex | cb41b55 |
213130069 has 2 divisors, whose sum is σ = 213130070. Its totient is φ = 213130068.
The previous prime is 213130067. The next prime is 213130079. The reversal of 213130069 is 960031312.
213130069 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., 200788900 + 12341169 = 14170^2 + 3513^2 .
It is a cyclic number.
It is not a de Polignac number, because 213130069 - 21 = 213130067 is a prime.
It is a super-3 number, since 3×2131300693 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 213130067, 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 (213130063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106565034 + 106565035.
It is an arithmetic number, because the mean of its divisors is an integer number (106565035).
Almost surely, 2213130069 is an apocalyptic number.
It is an amenable number.
213130069 is a deficient number, since it is larger than the sum of its proper divisors (1).
213130069 is an equidigital number, since it uses as much as digits as its factorization.
213130069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 25.
The square root of 213130069 is about 14598.9749297682. The cubic root of 213130069 is about 597.3307997062.
The spelling of 213130069 in words is "two hundred thirteen million, one hundred thirty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •