Base | Representation |
---|---|
bin | 1011100011001001… |
… | …0111011110010001 |
3 | 22000001121001002221 |
4 | 2320302113132101 |
5 | 22322123223324 |
6 | 1231344141041 |
7 | 136553234203 |
oct | 27062273621 |
9 | 8001531087 |
10 | 3100211089 |
11 | 1350a96528 |
12 | 726307781 |
13 | 3a53a0141 |
14 | 215a50773 |
15 | 13228b0e4 |
hex | b8c97791 |
3100211089 has 2 divisors, whose sum is σ = 3100211090. Its totient is φ = 3100211088.
The previous prime is 3100211063. The next prime is 3100211117. The reversal of 3100211089 is 9801120013.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2848036689 + 252174400 = 53367^2 + 15880^2 .
It is an emirp because it is prime and its reverse (9801120013) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3100211089 - 215 = 3100178321 is a prime.
It is a super-2 number, since 2×31002110892 = 19222617592717131842, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3100211029) 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, 1550105544 + 1550105545.
It is an arithmetic number, because the mean of its divisors is an integer number (1550105545).
Almost surely, 23100211089 is an apocalyptic number.
It is an amenable number.
3100211089 is a deficient number, since it is larger than the sum of its proper divisors (1).
3100211089 is an equidigital number, since it uses as much as digits as its factorization.
3100211089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
The square root of 3100211089 is about 55679.5392312113. The cubic root of 3100211089 is about 1458.1328306471.
The spelling of 3100211089 in words is "three billion, one hundred million, two hundred eleven thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •