Base | Representation |
---|---|
bin | 110000011100010010100000… |
… | …100011100010011011011000 |
3 | 1000221100101221100001021210110 |
4 | 300130102200203202123120 |
5 | 210411103403330441100 |
6 | 2033041533452244320 |
7 | 62606241561164031 |
oct | 6034224043423330 |
9 | 1027311840037713 |
10 | 213050251421400 |
11 | 6198011679a778 |
12 | 1ba8a6961706a0 |
13 | 91b5724b06673 |
14 | 3a87989905a88 |
15 | 1996dd51d1250 |
hex | c1c4a08e26d8 |
213050251421400 has 96 divisors (see below), whose sum is σ = 675815216218560. Its totient is φ = 55492158503040.
The previous prime is 213050251421383. The next prime is 213050251421419. The reversal of 213050251421400 is 4124152050312.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4128855042 + ... + 4128906641.
It is an arithmetic number, because the mean of its divisors is an integer number (7039741835610).
Almost surely, 2213050251421400 is an apocalyptic number.
213050251421400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
213050251421400 is an abundant number, since it is smaller than the sum of its proper divisors (462764964797160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213050251421400 is a wasteful number, since it uses less digits than its factorization.
213050251421400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8257761745 (or 8257761736 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
The spelling of 213050251421400 in words is "two hundred thirteen trillion, fifty billion, two hundred fifty-one million, four hundred twenty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •