Base | Representation |
---|---|
bin | 110000011111111100011010… |
… | …010111101101011001000110 |
3 | 1000222020102012112111210121210 |
4 | 300133330122113231121012 |
5 | 210424212233212302402 |
6 | 2033353151211352250 |
7 | 62633342421355335 |
oct | 6037743227553106 |
9 | 1028212175453553 |
10 | 213301403244102 |
11 | 61a67687414408 |
12 | 1bb0b2a8452686 |
13 | 920330b6bc144 |
14 | 3a95bb32a5d1c |
15 | 199d6d41bb06c |
hex | c1ff1a5ed646 |
213301403244102 has 8 divisors (see below), whose sum is σ = 426602806488216. Its totient is φ = 71100467748032.
The previous prime is 213301403244091. The next prime is 213301403244179. The reversal of 213301403244102 is 201442304103312.
It is a sphenic number, since it is the product of 3 distinct primes.
213301403244102 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 213301403244102.
It is a congruent number.
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, 17775116937003 + ... + 17775116937014.
It is an arithmetic number, because the mean of its divisors is an integer number (53325350811027).
Almost surely, 2213301403244102 is an apocalyptic number.
213301403244102 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.
213301403244102 is a wasteful number, since it uses less digits than its factorization.
213301403244102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35550233874022.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 213301403244102 its reverse (201442304103312), we get a palindrome (414743707347414).
The spelling of 213301403244102 in words is "two hundred thirteen trillion, three hundred one billion, four hundred three million, two hundred forty-four thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •