Base | Representation |
---|---|
bin | 110000101011100100010010… |
… | …001101010111000000011100 |
3 | 1001002001202212012020201222002 |
4 | 300223210102031113000130 |
5 | 211030304031314332200 |
6 | 2035204124134541432 |
7 | 63045136546624016 |
oct | 6053442215270034 |
9 | 1032052765221862 |
10 | 214100130230300 |
11 | 6224539aa32a86 |
12 | 2001a058507878 |
13 | 926072b9bbac2 |
14 | 3ac27045331b6 |
15 | 19b438084dbd5 |
hex | c2b91235701c |
214100130230300 has 36 divisors (see below), whose sum is σ = 466591262404176. Its totient is φ = 85272498211200.
The previous prime is 214100130230269. The next prime is 214100130230323. The reversal of 214100130230300 is 3032031001412.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4594400096 + ... + 4594446695.
It is an arithmetic number, because the mean of its divisors is an integer number (12960868400116).
Almost surely, 2214100130230300 is an apocalyptic number.
214100130230300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
214100130230300 is an abundant number, since it is smaller than the sum of its proper divisors (252491132173876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214100130230300 is a wasteful number, since it uses less digits than its factorization.
214100130230300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9188847038 (or 9188847031 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 214100130230300 its reverse (3032031001412), we get a palindrome (217132161231712).
The spelling of 214100130230300 in words is "two hundred fourteen trillion, one hundred billion, one hundred thirty million, two hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •