Base | Representation |
---|---|
bin | 1100010010110101100… |
… | …1100010010000100111 |
3 | 202012011221102002000211 |
4 | 3010231121202100213 |
5 | 11430032024104101 |
6 | 241010355520251 |
7 | 21155051303605 |
oct | 3045531422047 |
9 | 665157362024 |
10 | 211215066151 |
11 | 81637442411 |
12 | 34b275b9087 |
13 | 16bc09775ab |
14 | a319776875 |
15 | 5762d46c51 |
hex | 312d662427 |
211215066151 has 8 divisors (see below), whose sum is σ = 222456379520. Its totient is φ = 199986225912.
The previous prime is 211215066103. The next prime is 211215066187. The reversal of 211215066151 is 151660512112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211215066151 - 29 = 211215065639 is a prime.
It is a super-2 number, since 2×2112150661512 (a number of 23 digits) 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 (211215066551) 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 in 7 ways as a sum of consecutive naturals, for example, 3083505 + ... + 3151258.
It is an arithmetic number, because the mean of its divisors is an integer number (27807047440).
Almost surely, 2211215066151 is an apocalyptic number.
211215066151 is a deficient number, since it is larger than the sum of its proper divisors (11241313369).
211215066151 is a wasteful number, since it uses less digits than its factorization.
211215066151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6236565.
The product of its (nonzero) digits is 3600, while the sum is 31.
Adding to 211215066151 its reverse (151660512112), we get a palindrome (362875578263).
The spelling of 211215066151 in words is "two hundred eleven billion, two hundred fifteen million, sixty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •