Base | Representation |
---|---|
bin | 110000011011110110101000… |
… | …100001011000100001111110 |
3 | 1000221020112200101100221112020 |
4 | 300123312220201120201332 |
5 | 210410111103444200410 |
6 | 2033020103440421010 |
7 | 62604132055653606 |
oct | 6033665041304176 |
9 | 1027215611327466 |
10 | 213020320303230 |
11 | 61969457423680 |
12 | 1ba84922317766 |
13 | 91b2964aab15b |
14 | 3a8634a6abc06 |
15 | 1996232661a70 |
hex | c1bda885887e |
213020320303230 has 64 divisors (see below), whose sum is σ = 557727853632768. Its totient is φ = 51641111612160.
The previous prime is 213020320303213. The next prime is 213020320303243. The reversal of 213020320303230 is 32303023020312.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 213020320303230.
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 31 ways as a sum of consecutive naturals, for example, 112100277 + ... + 113984703.
It is an arithmetic number, because the mean of its divisors is an integer number (8714497713012).
Almost surely, 2213020320303230 is an apocalyptic number.
213020320303230 is an abundant number, since it is smaller than the sum of its proper divisors (344707533329538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213020320303230 is a wasteful number, since it uses less digits than its factorization.
213020320303230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2227001.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 213020320303230 its reverse (32303023020312), we get a palindrome (245323343323542).
The spelling of 213020320303230 in words is "two hundred thirteen trillion, twenty billion, three hundred twenty million, three hundred three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •