Base | Representation |
---|---|
bin | 11110010010100110111001… |
… | …111111101100101111000111 |
3 | 122110200201102021222012110121 |
4 | 132102212321333230233013 |
5 | 114430134302000301203 |
6 | 1151200251224402411 |
7 | 40026556535364403 |
oct | 3622467177545707 |
9 | 573621367865417 |
10 | 133220121103303 |
11 | 394a23773598a3 |
12 | 12b36b51016407 |
13 | 59447acc01030 |
14 | 24c7c61584103 |
15 | 10605639500bd |
hex | 7929b9fecbc7 |
133220121103303 has 32 divisors (see below), whose sum is σ = 152564433456960. Its totient is φ = 115238558023680.
The previous prime is 133220121103273. The next prime is 133220121103309. The reversal of 133220121103303 is 303301121022331.
It is not a de Polignac number, because 133220121103303 - 29 = 133220121102791 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 (133220121103309) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 80345343 + ... + 81986671.
It is an arithmetic number, because the mean of its divisors is an integer number (4767638545530).
Almost surely, 2133220121103303 is an apocalyptic number.
133220121103303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
133220121103303 is a deficient number, since it is larger than the sum of its proper divisors (19344312353657).
133220121103303 is a wasteful number, since it uses less digits than its factorization.
133220121103303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1642947.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 133220121103303 its reverse (303301121022331), we get a palindrome (436521242125634).
The spelling of 133220121103303 in words is "one hundred thirty-three trillion, two hundred twenty billion, one hundred twenty-one million, one hundred three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •