Base | Representation |
---|---|
bin | 11110010010100110111000… |
… | …110011001001000011100011 |
3 | 122110200201100220012120211220 |
4 | 132102212320303021003203 |
5 | 114430134231331043321 |
6 | 1151200245230310123 |
7 | 40026556202660052 |
oct | 3622467063110343 |
9 | 573621326176756 |
10 | 133220101034211 |
11 | 394a2366aa1674 |
12 | 12b36b46358343 |
13 | 59447a89c5329 |
14 | 24c7c5ca3c399 |
15 | 1060561cd89c6 |
hex | 7929b8cc90e3 |
133220101034211 has 4 divisors (see below), whose sum is σ = 177626801378952. Its totient is φ = 88813400689472.
The previous prime is 133220101034117. The next prime is 133220101034227. The reversal of 133220101034211 is 112430101022331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 133220101034211 - 223 = 133220092645603 is a prime.
It is not an unprimeable number, because it can be changed into a prime (133220101034261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22203350172366 + ... + 22203350172371.
It is an arithmetic number, because the mean of its divisors is an integer number (44406700344738).
Almost surely, 2133220101034211 is an apocalyptic number.
133220101034211 is a deficient number, since it is larger than the sum of its proper divisors (44406700344741).
133220101034211 is an equidigital number, since it uses as much as digits as its factorization.
133220101034211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44406700344740.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 133220101034211 its reverse (112430101022331), we get a palindrome (245650202056542).
The spelling of 133220101034211 in words is "one hundred thirty-three trillion, two hundred twenty billion, one hundred one million, thirty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.662 sec. • engine limits •