Base | Representation |
---|---|
bin | 1100010100101110000… |
… | …0101000111100111011 |
3 | 202020111010222211012110 |
4 | 3011023200220330323 |
5 | 11432100340320201 |
6 | 241132443343403 |
7 | 21203424250440 |
oct | 3051340507473 |
9 | 666433884173 |
10 | 211720245051 |
11 | 81876616837 |
12 | 35048821b63 |
13 | 16c71523a13 |
14 | a3668b99c7 |
15 | 57923846d6 |
hex | 314b828f3b |
211720245051 has 8 divisors (see below), whose sum is σ = 322621325824. Its totient is φ = 120982997160.
The previous prime is 211720245043. The next prime is 211720245089. The reversal of 211720245051 is 150542027112.
It is a happy number.
211720245051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211720245051 - 23 = 211720245043 is a prime.
It is not an unprimeable number, because it can be changed into a prime (211720245851) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 5040958195 + ... + 5040958236.
It is an arithmetic number, because the mean of its divisors is an integer number (40327665728).
Almost surely, 2211720245051 is an apocalyptic number.
211720245051 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
211720245051 is a deficient number, since it is larger than the sum of its proper divisors (110901080773).
211720245051 is a wasteful number, since it uses less digits than its factorization.
211720245051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10081916441.
The product of its (nonzero) digits is 5600, while the sum is 30.
The spelling of 211720245051 in words is "two hundred eleven billion, seven hundred twenty million, two hundred forty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •