Base | Representation |
---|---|
bin | 1100010010011010011… |
… | …0011011110010110100 |
3 | 202011212222210021022212 |
4 | 3010212212123302310 |
5 | 11424313324211103 |
6 | 240551203112552 |
7 | 21152164644662 |
oct | 3044646336264 |
9 | 664788707285 |
10 | 211101007028 |
11 | 8158901907a |
12 | 34ab5372758 |
13 | 16ba31507a2 |
14 | a308565c32 |
15 | 5757d167d8 |
hex | 312699bcb4 |
211101007028 has 6 divisors (see below), whose sum is σ = 369426762306. Its totient is φ = 105550503512.
The previous prime is 211101007021. The next prime is 211101007043. The reversal of 211101007028 is 820700101112.
211101007028 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 203447906704 + 7653100324 = 451052^2 + 87482^2 .
It is a junction number, because it is equal to n+sod(n) for n = 211101006994 and 211101007012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211101007021) 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 as a sum of consecutive naturals, namely, 26387625875 + ... + 26387625882.
It is an arithmetic number, because the mean of its divisors is an integer number (61571127051).
Almost surely, 2211101007028 is an apocalyptic number.
It is an amenable number.
211101007028 is a deficient number, since it is larger than the sum of its proper divisors (158325755278).
211101007028 is a wasteful number, since it uses less digits than its factorization.
211101007028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52775251761 (or 52775251759 counting only the distinct ones).
The product of its (nonzero) digits is 224, while the sum is 23.
The spelling of 211101007028 in words is "two hundred eleven billion, one hundred one million, seven thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •