Base | Representation |
---|---|
bin | 101111111111000110111110… |
… | …101000001000110110111100 |
3 | 1000200020201001100102102120021 |
4 | 233333012332220020312330 |
5 | 210130230133042413021 |
6 | 2024504423140301524 |
7 | 62311332665160544 |
oct | 5777067650106674 |
9 | 1020221040372507 |
10 | 211045006216636 |
11 | 61277759093a19 |
12 | 1b805b296a18a4 |
13 | 909b5c698c847 |
14 | 3a188c05a6324 |
15 | 195eb719b3c41 |
hex | bff1bea08dbc |
211045006216636 has 24 divisors (see below), whose sum is σ = 371556179162784. Its totient is φ = 104886401891520.
The previous prime is 211045006216619. The next prime is 211045006216637. The reversal of 211045006216636 is 636612600540112.
It is a junction number, because it is equal to n+sod(n) for n = 211045006216592 and 211045006216601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211045006216637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35221800 + ... + 40775791.
It is an arithmetic number, because the mean of its divisors is an integer number (15481507465116).
Almost surely, 2211045006216636 is an apocalyptic number.
It is an amenable number.
211045006216636 is a deficient number, since it is larger than the sum of its proper divisors (160511172946148).
211045006216636 is a wasteful number, since it uses less digits than its factorization.
211045006216636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76001781 (or 76001779 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 43.
Adding to 211045006216636 its reverse (636612600540112), we get a palindrome (847657606756748).
The spelling of 211045006216636 in words is "two hundred eleven trillion, forty-five billion, six million, two hundred sixteen thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •