Base | Representation |
---|---|
bin | 1100011011001001000… |
… | …0001111100100001011 |
3 | 202101221021112122110202 |
4 | 3012302100033210023 |
5 | 11444113131000021 |
6 | 242015501402415 |
7 | 21264225031214 |
oct | 3066220174413 |
9 | 671837478422 |
10 | 213444000011 |
11 | 82580634410 |
12 | 35449b6940b |
13 | 17187699878 |
14 | a48b7c640b |
15 | 584387ba0b |
hex | 31b240f90b |
213444000011 has 8 divisors (see below), whose sum is σ = 233713609200. Its totient is φ = 193318659040.
The previous prime is 213443999971. The next prime is 213444000023. The reversal of 213444000011 is 110000444312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213444000011 is a prime.
It is a super-2 number, since 2×2134440000112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213444000911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36063956 + ... + 36069873.
It is an arithmetic number, because the mean of its divisors is an integer number (29214201150).
Almost surely, 2213444000011 is an apocalyptic number.
213444000011 is a deficient number, since it is larger than the sum of its proper divisors (20269609189).
213444000011 is a wasteful number, since it uses less digits than its factorization.
213444000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72134109.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 213444000011 its reverse (110000444312), we get a palindrome (323444444323).
The spelling of 213444000011 in words is "two hundred thirteen billion, four hundred forty-four million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •