Base | Representation |
---|---|
bin | 110000010010110100111011… |
… | …001110011100001011111100 |
3 | 1000212001020112222121011121102 |
4 | 300102310323032130023330 |
5 | 210314430210400032200 |
6 | 2031423115042352232 |
7 | 62511252166461143 |
oct | 6022647316341374 |
9 | 1025036488534542 |
10 | 212400011330300 |
11 | 6174a380159132 |
12 | 1b9a466605b678 |
13 | 9169309756001 |
14 | 3a643030b475a |
15 | 19850298956d5 |
hex | c12d3b39c2fc |
212400011330300 has 36 divisors (see below), whose sum is σ = 461325892482336. Its totient is φ = 84882978192000.
The previous prime is 212400011330293. The next prime is 212400011330363. The reversal of 212400011330300 is 3033110004212.
It is a super-2 number, since 2×2124000113303002 (a number of 29 digits) contains 22 as substring.
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, 962718401 + ... + 962939000.
Almost surely, 2212400011330300 is an apocalyptic number.
212400011330300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212400011330300 is an abundant number, since it is smaller than the sum of its proper divisors (248925881152036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212400011330300 is a wasteful number, since it uses less digits than its factorization.
212400011330300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1925658518 (or 1925658511 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 212400011330300 its reverse (3033110004212), we get a palindrome (215433121334512).
The spelling of 212400011330300 in words is "two hundred twelve trillion, four hundred billion, eleven million, three hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •