Base | Representation |
---|---|
bin | 1100010010000101000… |
… | …0010011100111110110 |
3 | 202011122202000201021120 |
4 | 3010201100103213312 |
5 | 11424122344222220 |
6 | 240534240524410 |
7 | 21150025425450 |
oct | 3044120234766 |
9 | 664582021246 |
10 | 211011320310 |
11 | 8154243111a |
12 | 34a8b320706 |
13 | 16b8a6ab31b |
14 | a2da69b2d0 |
15 | 574eeeca40 |
hex | 31214139f6 |
211011320310 has 32 divisors (see below), whose sum is σ = 578773907712. Its totient is φ = 48231158880.
The previous prime is 211011320281. The next prime is 211011320341. The reversal of 211011320310 is 13023110112.
It is a happy number.
It is a super-2 number, since 2×2110113203102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 211011320310.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 502407696 + ... + 502408115.
It is an arithmetic number, because the mean of its divisors is an integer number (18086684616).
Almost surely, 2211011320310 is an apocalyptic number.
211011320310 is an abundant number, since it is smaller than the sum of its proper divisors (367762587402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211011320310 is a wasteful number, since it uses less digits than its factorization.
211011320310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1004815828.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 211011320310 its reverse (13023110112), we get a palindrome (224034430422).
The spelling of 211011320310 in words is "two hundred eleven billion, eleven million, three hundred twenty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •