Base | Representation |
---|---|
bin | 1100011101010111100… |
… | …1111110101000000000 |
3 | 202110110222001110201101 |
4 | 3013111321332220000 |
5 | 12001324242040412 |
6 | 242155105544144 |
7 | 21315110125051 |
oct | 3072571765000 |
9 | 673428043641 |
10 | 214042143232 |
11 | 82858234255 |
12 | 35596345054 |
13 | 17251595278 |
14 | a507008728 |
15 | 587b12e457 |
hex | 31d5e7ea00 |
214042143232 has 40 divisors (see below), whose sum is σ = 427736608596. Its totient is φ = 107003461632.
The previous prime is 214042143179. The next prime is 214042143233. The reversal of 214042143232 is 232341240412.
214042143232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 212912107776 + 1130035456 = 461424^2 + 33616^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 214042143232.
It is not an unprimeable number, because it can be changed into a prime (214042143233) 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, 3418318 + ... + 3480370.
Almost surely, 2214042143232 is an apocalyptic number.
It is an amenable number.
214042143232 is a deficient number, since it is larger than the sum of its proper divisors (213694465364).
214042143232 is an frugal number, since it uses more digits than its factorization.
214042143232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68808 (or 68792 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 214042143232 its reverse (232341240412), we get a palindrome (446383383644).
The spelling of 214042143232 in words is "two hundred fourteen billion, forty-two million, one hundred forty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •