Base | Representation |
---|---|
bin | 1100011110011100100… |
… | …0011010110001010000 |
3 | 202111020002212002101211 |
4 | 3013213020122301100 |
5 | 12002422233004300 |
6 | 242243512105504 |
7 | 21325216432531 |
oct | 3074710326120 |
9 | 674202762354 |
10 | 214331141200 |
11 | 82996383750 |
12 | 35657095294 |
13 | 17299410397 |
14 | a533556688 |
15 | 58966b84ba |
hex | 31e721ac50 |
214331141200 has 60 divisors (see below), whose sum is σ = 561742447968. Its totient is φ = 77938595200.
The previous prime is 214331141177. The next prime is 214331141231. The reversal of 214331141200 is 2141133412.
214331141200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 24351412 + ... + 24360211.
Almost surely, 2214331141200 is an apocalyptic number.
214331141200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
214331141200 is an abundant number, since it is smaller than the sum of its proper divisors (347411306768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214331141200 is a wasteful number, since it uses less digits than its factorization.
214331141200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48711652 (or 48711641 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 214331141200 its reverse (2141133412), we get a palindrome (216472274612).
The spelling of 214331141200 in words is "two hundred fourteen billion, three hundred thirty-one million, one hundred forty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •