Base | Representation |
---|---|
bin | 101101100001100000000010… |
… | …111010011011111001110100 |
3 | 222020220021221221011100210100 |
4 | 231201200002322123321310 |
5 | 202220302233022442122 |
6 | 1545453053141154100 |
7 | 60113000422222515 |
oct | 5541400272337164 |
9 | 866807857140710 |
10 | 200214244343412 |
11 | 588814253a2592 |
12 | 1a556a413bb930 |
13 | 87941786cba10 |
14 | 37625c7824a0c |
15 | 1823072d0eaac |
hex | b61802e9be74 |
200214244343412 has 144 divisors (see below), whose sum is σ = 574863070600000. Its totient is φ = 58245087633408.
The previous prime is 200214244343389. The next prime is 200214244343429. The reversal of 200214244343412 is 214343442412002.
200214244343412 is a `hidden beast` number, since 2 + 0 + 0 + 214 + 2 + 4 + 4 + 3 + 434 + 1 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 18124237 + ... + 26998452.
Almost surely, 2200214244343412 is an apocalyptic number.
It is an amenable number.
200214244343412 is an abundant number, since it is smaller than the sum of its proper divisors (374648826256588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200214244343412 is a wasteful number, since it uses less digits than its factorization.
200214244343412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45123230 (or 45123225 counting only the distinct ones).
The product of its (nonzero) digits is 147456, while the sum is 36.
Adding to 200214244343412 its reverse (214343442412002), we get a palindrome (414557686755414).
The spelling of 200214244343412 in words is "two hundred trillion, two hundred fourteen billion, two hundred forty-four million, three hundred forty-three thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.319 sec. • engine limits •