Base | Representation |
---|---|
bin | 11110010010100110110011… |
… | …011100000100011111100101 |
3 | 122110200201010121222110111010 |
4 | 132102212303130010133211 |
5 | 114430134040320201013 |
6 | 1151200232254532433 |
7 | 40026554031360426 |
oct | 3622466334043745 |
9 | 573621117873433 |
10 | 133220011100133 |
11 | 394a2320255891 |
12 | 12b36b20207119 |
13 | 59447931973b9 |
14 | 24c7c50b0b64d |
15 | 1060558e717c3 |
hex | 7929b37047e5 |
133220011100133 has 8 divisors (see below), whose sum is σ = 177827844190048. Its totient is φ = 88712759371824.
The previous prime is 133220011100131. The next prime is 133220011100173. The reversal of 133220011100133 is 331001110022331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133220011100133 - 21 = 133220011100131 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133220011100131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25145337310 + ... + 25145342607.
It is an arithmetic number, because the mean of its divisors is an integer number (22228480523756).
Almost surely, 2133220011100133 is an apocalyptic number.
It is an amenable number.
133220011100133 is a deficient number, since it is larger than the sum of its proper divisors (44607833089915).
133220011100133 is an equidigital number, since it uses as much as digits as its factorization.
133220011100133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50290680803.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 133220011100133 its reverse (331001110022331), we get a palindrome (464221121122464).
The spelling of 133220011100133 in words is "one hundred thirty-three trillion, two hundred twenty billion, eleven million, one hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.267 sec. • engine limits •