Base | Representation |
---|---|
bin | 110000000001101100000111… |
… | …111101000100110100010101 |
3 | 1000200212122202100121002022111 |
4 | 300001230013331010310111 |
5 | 210141131313001213023 |
6 | 2025122110542431021 |
7 | 62330211150262360 |
oct | 6001540775046425 |
9 | 1020778670532274 |
10 | 211222330101013 |
11 | 613359838728a0 |
12 | 1b834376b92471 |
13 | 90b2246060b0a |
14 | 3a23302bc90d7 |
15 | 196459e2a400d |
hex | c01b07f44d15 |
211222330101013 has 16 divisors (see below), whose sum is σ = 263343863471616. Its totient is φ = 164587742630640.
The previous prime is 211222330101001. The next prime is 211222330101037. The reversal of 211222330101013 is 310101033222112.
It is not a de Polignac number, because 211222330101013 - 213 = 211222330092821 is a prime.
It is a super-2 number, since 2×2112223301010132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211222330101613) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2795170 + ... + 20742652.
It is an arithmetic number, because the mean of its divisors is an integer number (16458991466976).
Almost surely, 2211222330101013 is an apocalyptic number.
It is an amenable number.
211222330101013 is a deficient number, since it is larger than the sum of its proper divisors (52121533370603).
211222330101013 is a wasteful number, since it uses less digits than its factorization.
211222330101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18100344.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 211222330101013 its reverse (310101033222112), we get a palindrome (521323363323125).
The spelling of 211222330101013 in words is "two hundred eleven trillion, two hundred twenty-two billion, three hundred thirty million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •