Base | Representation |
---|---|
bin | 10110011000010000100010… |
… | …00101110001001000100011 |
3 | 20110020121211102112111212101 |
4 | 23030020101011301020203 |
5 | 22422242210113032321 |
6 | 252355405114111231 |
7 | 13236310532101165 |
oct | 1314102105611043 |
9 | 213217742474771 |
10 | 49212022002211 |
11 | 14753779513612 |
12 | 562975271b517 |
13 | 215c89b3429a3 |
14 | c21c35b8a935 |
15 | 5a51b6ed7791 |
hex | 2cc211171223 |
49212022002211 has 16 divisors (see below), whose sum is σ = 52312264940160. Its totient is φ = 46163226127680.
The previous prime is 49212022002197. The next prime is 49212022002331. The reversal of 49212022002211 is 11220022021294.
It is a cyclic number.
It is not a de Polignac number, because 49212022002211 - 29 = 49212022001699 is a prime.
It is a super-2 number, since 2×492120220022112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 49212022002211.
It is not an unprimeable number, because it can be changed into a prime (49212022002911) by changing a digit.
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, 1930186 + ... + 10106911.
It is an arithmetic number, because the mean of its divisors is an integer number (3269516558760).
Almost surely, 249212022002211 is an apocalyptic number.
49212022002211 is a deficient number, since it is larger than the sum of its proper divisors (3100242937949).
49212022002211 is a wasteful number, since it uses less digits than its factorization.
49212022002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12039234.
The product of its (nonzero) digits is 2304, while the sum is 28.
The spelling of 49212022002211 in words is "forty-nine trillion, two hundred twelve billion, twenty-two million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •