Base | Representation |
---|---|
bin | 110000101001000000111110… |
… | …001000111011111001100010 |
3 | 1001001110000020021211101220110 |
4 | 300221000332020323321202 |
5 | 211014420414020442213 |
6 | 2034551403445552150 |
7 | 63026361213136221 |
oct | 6051007610737142 |
9 | 1031400207741813 |
10 | 213924773609058 |
11 | 62187a94771006 |
12 | 1bbb0079a15656 |
13 | 924a034072265 |
14 | 3ab802b2c6cb8 |
15 | 19aea1ab065c3 |
hex | c2903e23be62 |
213924773609058 has 8 divisors (see below), whose sum is σ = 427849547218128. Its totient is φ = 71308257869684.
The previous prime is 213924773609021. The next prime is 213924773609147. The reversal of 213924773609058 is 850906377429312.
It is a sphenic number, since it is the product of 3 distinct primes.
213924773609058 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 213924773609058.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17827064467416 + ... + 17827064467427.
It is an arithmetic number, because the mean of its divisors is an integer number (53481193402266).
It is a 1-persistent number, because it is pandigital, but 2⋅213924773609058 = 427849547218116 is not.
Almost surely, 2213924773609058 is an apocalyptic number.
213924773609058 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213924773609058 is a wasteful number, since it uses less digits than its factorization.
213924773609058 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35654128934848.
The product of its (nonzero) digits is 137168640, while the sum is 66.
The spelling of 213924773609058 in words is "two hundred thirteen trillion, nine hundred twenty-four billion, seven hundred seventy-three million, six hundred nine thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •