Base | Representation |
---|---|
bin | 1011001011010011… |
… | …1001101010000101 |
3 | 21202002102120021201 |
4 | 2302310321222011 |
5 | 22121023241401 |
6 | 1213412542501 |
7 | 134230245025 |
oct | 26264715205 |
9 | 7662376251 |
10 | 3000212101 |
11 | 12aa5a5837 |
12 | 6b8921a31 |
13 | 38a759c43 |
14 | 20665da85 |
15 | 1285d6b01 |
hex | b2d39a85 |
3000212101 has 2 divisors, whose sum is σ = 3000212102. Its totient is φ = 3000212100.
The previous prime is 3000212093. The next prime is 3000212107. The reversal of 3000212101 is 1012120003.
3000212101 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., 3000191076 + 21025 = 54774^2 + 145^2 .
It is an emirp because it is prime and its reverse (1012120003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3000212101 - 23 = 3000212093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3000212107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1500106050 + 1500106051.
It is an arithmetic number, because the mean of its divisors is an integer number (1500106051).
Almost surely, 23000212101 is an apocalyptic number.
It is an amenable number.
3000212101 is a deficient number, since it is larger than the sum of its proper divisors (1).
3000212101 is an equidigital number, since it uses as much as digits as its factorization.
3000212101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 3000212101 is about 54774.1919246647. The cubic root of 3000212101 is about 1442.2835586815.
Adding to 3000212101 its reverse (1012120003), we get a palindrome (4012332104).
The spelling of 3000212101 in words is "three billion, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •