Base | Representation |
---|---|
bin | 111011101000110… |
… | …0110010101001101 |
3 | 12011110102112002201 |
4 | 1313101212111031 |
5 | 13044240232112 |
6 | 530322321501 |
7 | 100406042035 |
oct | 16721462515 |
9 | 5143375081 |
10 | 2001102157 |
11 | 93762a73a |
12 | 47a1b9291 |
13 | 25b771c22 |
14 | 14daa48c5 |
15 | baa2e257 |
hex | 7746654d |
2001102157 has 2 divisors, whose sum is σ = 2001102158. Its totient is φ = 2001102156.
The previous prime is 2001102121. The next prime is 2001102179. The reversal of 2001102157 is 7512011002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1676165481 + 324936676 = 40941^2 + 18026^2 .
It is a cyclic number.
It is not a de Polignac number, because 2001102157 - 223 = 1992713549 is a prime.
It is a super-3 number, since 3×20011021573 (a number of 29 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2001106157) 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, 1000551078 + 1000551079.
It is an arithmetic number, because the mean of its divisors is an integer number (1000551079).
Almost surely, 22001102157 is an apocalyptic number.
It is an amenable number.
2001102157 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001102157 is an equidigital number, since it uses as much as digits as its factorization.
2001102157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 19.
The square root of 2001102157 is about 44733.6803426680. The cubic root of 2001102157 is about 1260.1524458617.
Adding to 2001102157 its reverse (7512011002), we get a palindrome (9513113159).
The spelling of 2001102157 in words is "two billion, one million, one hundred two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •