Base | Representation |
---|---|
bin | 110000011111000101000101… |
… | …101010010111101011000100 |
3 | 1000222000201212121212001022010 |
4 | 300133011011222113223010 |
5 | 210422224104000422040 |
6 | 2033310004502134220 |
7 | 62626140356264535 |
oct | 6037050552275304 |
9 | 1028021777761263 |
10 | 213242000014020 |
11 | 61a4447388942a |
12 | 1babb88a421370 |
13 | 91ca832799563 |
14 | 3a92d79b9868c |
15 | 199bda9048e80 |
hex | c1f145a97ac4 |
213242000014020 has 24 divisors (see below), whose sum is σ = 597077600039424. Its totient is φ = 56864533337056.
The previous prime is 213242000014007. The next prime is 213242000014073. The reversal of 213242000014020 is 20410000242312.
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 7 ways as a sum of consecutive naturals, for example, 1777016666724 + ... + 1777016666843.
It is an arithmetic number, because the mean of its divisors is an integer number (24878233334976).
Almost surely, 2213242000014020 is an apocalyptic number.
213242000014020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
213242000014020 is an abundant number, since it is smaller than the sum of its proper divisors (383835600025404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213242000014020 is a wasteful number, since it uses less digits than its factorization.
213242000014020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3554033333579 (or 3554033333577 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 213242000014020 its reverse (20410000242312), we get a palindrome (233652000256332).
The spelling of 213242000014020 in words is "two hundred thirteen trillion, two hundred forty-two billion, fourteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •