Base | Representation |
---|---|
bin | 111110110001010… |
… | …0011101101001111 |
3 | 12102210012121112102 |
4 | 1331202203231033 |
5 | 13303142224101 |
6 | 544555225315 |
7 | 103123333202 |
oct | 17542435517 |
9 | 5383177472 |
10 | 2106211151 |
11 | 9909a0680 |
12 | 4a944823b |
13 | 277483cb5 |
14 | 15da25939 |
15 | c4d9286b |
hex | 7d8a3b4f |
2106211151 has 4 divisors (see below), whose sum is σ = 2297684904. Its totient is φ = 1914737400.
The previous prime is 2106211109. The next prime is 2106211153. The reversal of 2106211151 is 1511126012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2106211151 - 218 = 2105949007 is a prime.
It is a super-2 number, since 2×21062111512 = 8872250825193489602, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2106211153) 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 in 3 ways as a sum of consecutive naturals, for example, 95736860 + ... + 95736881.
It is an arithmetic number, because the mean of its divisors is an integer number (574421226).
Almost surely, 22106211151 is an apocalyptic number.
2106211151 is a deficient number, since it is larger than the sum of its proper divisors (191473753).
2106211151 is a wasteful number, since it uses less digits than its factorization.
2106211151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191473752.
The product of its (nonzero) digits is 120, while the sum is 20.
The square root of 2106211151 is about 45893.4761267873. The cubic root of 2106211151 is about 1281.8404414516.
Adding to 2106211151 its reverse (1511126012), we get a palindrome (3617337163).
The spelling of 2106211151 in words is "two billion, one hundred six million, two hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •