Base | Representation |
---|---|
bin | 110000010001011010101100… |
… | …000100100010010000000100 |
3 | 1000211200222110111001102112011 |
4 | 300101122230010202100010 |
5 | 210311333242244430200 |
6 | 2031310412415504004 |
7 | 62501252143424164 |
oct | 6021325404422004 |
9 | 1024628414042464 |
10 | 212303120311300 |
11 | 6171227a759517 |
12 | 1b989925528004 |
13 | 91601380973c5 |
14 | 3a5d750d085a4 |
15 | 198275857a5ba |
hex | c116ac122404 |
212303120311300 has 36 divisors (see below), whose sum is σ = 460731015858960. Its totient is φ = 84915120053920.
The previous prime is 212303120311253. The next prime is 212303120311313. The reversal of 212303120311300 is 3113021303212.
It is a super-2 number, since 2×2123031203113002 (a number of 29 digits) contains 22 as substring.
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, 75208054 + ... + 77979853.
It is an arithmetic number, because the mean of its divisors is an integer number (12798083773860).
Almost surely, 2212303120311300 is an apocalyptic number.
212303120311300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212303120311300 is an abundant number, since it is smaller than the sum of its proper divisors (248427895547660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212303120311300 is a wasteful number, since it uses less digits than its factorization.
212303120311300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153201780 (or 153201773 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 212303120311300 its reverse (3113021303212), we get a palindrome (215416141614512).
The spelling of 212303120311300 in words is "two hundred twelve trillion, three hundred three billion, one hundred twenty million, three hundred eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •