Base | Representation |
---|---|
bin | 110000010010000110100100… |
… | …110000101010100011000111 |
3 | 1000211212111002111101120210120 |
4 | 300102012210300222203013 |
5 | 210313121244012132101 |
6 | 2031344204331353023 |
7 | 62504540650636542 |
oct | 6022064460524307 |
9 | 1024774074346716 |
10 | 212350242302151 |
11 | 61730260902708 |
12 | 1b996a965b2773 |
13 | 91647077c5a25 |
14 | 3a61b41309859 |
15 | 1983ab5426b36 |
hex | c121a4c2a8c7 |
212350242302151 has 24 divisors (see below), whose sum is σ = 294711866380800. Its totient is φ = 135930939207504.
The previous prime is 212350242302059. The next prime is 212350242302201. The reversal of 212350242302151 is 151203242053212.
It is not a de Polignac number, because 212350242302151 - 235 = 212315882563783 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212350242302551) 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 23 ways as a sum of consecutive naturals, for example, 235995351 + ... + 236893448.
It is an arithmetic number, because the mean of its divisors is an integer number (12279661099200).
Almost surely, 2212350242302151 is an apocalyptic number.
212350242302151 is a deficient number, since it is larger than the sum of its proper divisors (82361624078649).
212350242302151 is an equidigital number, since it uses as much as digits as its factorization.
212350242302151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472888963 (or 472888904 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 212350242302151 its reverse (151203242053212), we get a palindrome (363553484355363).
The spelling of 212350242302151 in words is "two hundred twelve trillion, three hundred fifty billion, two hundred forty-two million, three hundred two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •