Base | Representation |
---|---|
bin | 1100011110011010110… |
… | …1101110101111011000 |
3 | 202111012121200122120110 |
4 | 3013212231232233120 |
5 | 12002413440120422 |
6 | 242243102124320 |
7 | 21325103114010 |
oct | 3074655565730 |
9 | 674177618513 |
10 | 214324145112 |
11 | 82992435460 |
12 | 356548806a0 |
13 | 17297b30b9c |
14 | a532654c40 |
15 | 5895c8560c |
hex | 31e6b6ebd8 |
214324145112 has 64 divisors (see below), whose sum is σ = 668023315200. Its totient is φ = 55668608640.
The previous prime is 214324144997. The next prime is 214324145137. The reversal of 214324145112 is 211541423412.
It is a self number, because there is not a number n which added to its sum of digits gives 214324145112.
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 15 ways as a sum of consecutive naturals, for example, 57986287 + ... + 57989982.
It is an arithmetic number, because the mean of its divisors is an integer number (10437864300).
Almost surely, 2214324145112 is an apocalyptic number.
214324145112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
214324145112 is an abundant number, since it is smaller than the sum of its proper divisors (453699170088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214324145112 is a wasteful number, since it uses less digits than its factorization.
214324145112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115976296 (or 115976292 counting only the distinct ones).
The product of its digits is 7680, while the sum is 30.
Adding to 214324145112 its reverse (211541423412), we get a palindrome (425865568524).
The spelling of 214324145112 in words is "two hundred fourteen billion, three hundred twenty-four million, one hundred forty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.829 sec. • engine limits •