Base | Representation |
---|---|
bin | 1100010101110100010… |
… | …1111010111011001111 |
3 | 202021020201001122101210 |
4 | 3011131011322323033 |
5 | 11433201344340141 |
6 | 241222022105503 |
7 | 21213635504016 |
oct | 3053505727317 |
9 | 667221048353 |
10 | 212015230671 |
11 | 81a08085902 |
12 | 3510b57b293 |
13 | 16cba68731a |
14 | a393b45a7d |
15 | 57ad202916 |
hex | 315d17aecf |
212015230671 has 8 divisors (see below), whose sum is σ = 283126614400. Its totient is φ = 141123667032.
The previous prime is 212015230657. The next prime is 212015230673. The reversal of 212015230671 is 176032510212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-212015230671 is a prime.
It is a super-2 number, since 2×2120152306712 (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 (212015230673) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54952771 + ... + 54956628.
It is an arithmetic number, because the mean of its divisors is an integer number (35390826800).
Almost surely, 2212015230671 is an apocalyptic number.
212015230671 is a deficient number, since it is larger than the sum of its proper divisors (71111383729).
212015230671 is a wasteful number, since it uses less digits than its factorization.
212015230671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109910045.
The product of its (nonzero) digits is 5040, while the sum is 30.
Adding to 212015230671 its reverse (176032510212), we get a palindrome (388047740883).
The spelling of 212015230671 in words is "two hundred twelve billion, fifteen million, two hundred thirty thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •