Base | Representation |
---|---|
bin | 1100011101010101110… |
… | …1110001000100011100 |
3 | 202110110110010201220220 |
4 | 3013111131301010130 |
5 | 12001320343411201 |
6 | 242154243241340 |
7 | 21314660223501 |
oct | 3072535610434 |
9 | 673413121826 |
10 | 214034747676 |
11 | 82854042922 |
12 | 35593979250 |
13 | 1724cba5cb9 |
14 | a5060414a8 |
15 | 587a66d036 |
hex | 31d577111c |
214034747676 has 12 divisors (see below), whose sum is σ = 499414411272. Its totient is φ = 71344915888.
The previous prime is 214034747671. The next prime is 214034747701. The reversal of 214034747676 is 676747430412.
214034747676 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214034747671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8918114475 + ... + 8918114498.
It is an arithmetic number, because the mean of its divisors is an integer number (41617867606).
Almost surely, 2214034747676 is an apocalyptic number.
It is an amenable number.
214034747676 is an abundant number, since it is smaller than the sum of its proper divisors (285379663596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214034747676 is a wasteful number, since it uses less digits than its factorization.
214034747676 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17836228980 (or 17836228978 counting only the distinct ones).
The product of its (nonzero) digits is 4741632, while the sum is 51.
The spelling of 214034747676 in words is "two hundred fourteen billion, thirty-four million, seven hundred forty-seven thousand, six hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •