Base | Representation |
---|---|
bin | 110000011011100011110100… |
… | …001001011000101011101100 |
3 | 1000221011121112012002210121110 |
4 | 300123203310021120223230 |
5 | 210404243213221304312 |
6 | 2033002522430432020 |
7 | 62602515252206112 |
oct | 6033436411305354 |
9 | 1027147465083543 |
10 | 213000114244332 |
11 | 61960928653548 |
12 | 1ba80a23362610 |
13 | 91b0a9480749c |
14 | 3a85390ca7ab2 |
15 | 199594d79143c |
hex | c1b8f4258aec |
213000114244332 has 24 divisors (see below), whose sum is σ = 497041515166000. Its totient is φ = 70994145424896.
The previous prime is 213000114244297. The next prime is 213000114244339. The reversal of 213000114244332 is 233442411000312.
It is a self number, because there is not a number n which added to its sum of digits gives 213000114244332.
It is not an unprimeable number, because it can be changed into a prime (213000114244339) 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, 736431457 + ... + 736720632.
Almost surely, 2213000114244332 is an apocalyptic number.
It is an amenable number.
213000114244332 is an abundant number, since it is smaller than the sum of its proper divisors (284041400921668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213000114244332 is a wasteful number, since it uses less digits than its factorization.
213000114244332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1473164145 (or 1473164143 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 213000114244332 its reverse (233442411000312), we get a palindrome (446442525244644).
The spelling of 213000114244332 in words is "two hundred thirteen trillion, one hundred fourteen million, two hundred forty-four thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •