Base | Representation |
---|---|
bin | 1100010110101100010… |
… | …0111100100010010111 |
3 | 202021212001112212001101 |
4 | 3011223010330202113 |
5 | 11434141430344101 |
6 | 241301203010531 |
7 | 21222515003224 |
oct | 3055304744227 |
9 | 667761485041 |
10 | 212249856151 |
11 | 82018568463 |
12 | 35176069a47 |
13 | 17027175a78 |
14 | a3b6d7c94b |
15 | 57c3aeb401 |
hex | 316b13c897 |
212249856151 has 16 divisors (see below), whose sum is σ = 221525604000. Its totient is φ = 203220878848.
The previous prime is 212249856139. The next prime is 212249856157. The reversal of 212249856151 is 151658942212.
It is a happy number.
212249856151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212249856151 is a prime.
It is a super-2 number, since 2×2122498561512 (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 (212249856157) 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 15 ways as a sum of consecutive naturals, for example, 180675 + ... + 676123.
It is an arithmetic number, because the mean of its divisors is an integer number (13845350250).
Almost surely, 2212249856151 is an apocalyptic number.
212249856151 is a deficient number, since it is larger than the sum of its proper divisors (9275747849).
212249856151 is a wasteful number, since it uses less digits than its factorization.
212249856151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 495698.
The product of its digits is 345600, while the sum is 46.
The spelling of 212249856151 in words is "two hundred twelve billion, two hundred forty-nine million, eight hundred fifty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •