Base | Representation |
---|---|
bin | 1100011101101110101… |
… | …1101110101000011000 |
3 | 202110201201102220121201 |
4 | 3013123223232220120 |
5 | 12002024100233000 |
6 | 242212451243544 |
7 | 21320365033231 |
oct | 3073353565030 |
9 | 673651386551 |
10 | 214139071000 |
11 | 828a7a17548 |
12 | 356028a95b4 |
13 | 172686a158a |
14 | a515c3a088 |
15 | 58848c896a |
hex | 31dbaeea18 |
214139071000 has 128 divisors (see below), whose sum is σ = 504648144000. Its totient is φ = 85048972800.
The previous prime is 214139070989. The next prime is 214139071049. The reversal of 214139071000 is 170931412.
It is a self number, because there is not a number n which added to its sum of digits gives 214139071000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 91785834 + ... + 91788166.
It is an arithmetic number, because the mean of its divisors is an integer number (3942563625).
Almost surely, 2214139071000 is an apocalyptic number.
214139071000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 214139071000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (252324072000).
214139071000 is an abundant number, since it is smaller than the sum of its proper divisors (290509073000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214139071000 is a wasteful number, since it uses less digits than its factorization.
214139071000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2966 (or 2952 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 28.
The spelling of 214139071000 in words is "two hundred fourteen billion, one hundred thirty-nine million, seventy-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •