Base | Representation |
---|---|
bin | 111101111111000010… |
… | …0000101010111110001 |
3 | 110201120202202221101112 |
4 | 1323332010011113301 |
5 | 4140103021033241 |
6 | 141052305243105 |
7 | 12421425046460 |
oct | 1737604052761 |
9 | 421522687345 |
10 | 133111502321 |
11 | 514a7a77956 |
12 | 2196a933495 |
13 | c7246c9175 |
14 | 662a8189d7 |
15 | 36e10d01eb |
hex | 1efe1055f1 |
133111502321 has 4 divisors (see below), whose sum is σ = 152127431232. Its totient is φ = 114095573412.
The previous prime is 133111502297. The next prime is 133111502323. The reversal of 133111502321 is 123205111331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 123205111331 = 8941 ⋅13779791.
It is a cyclic number.
It is not a de Polignac number, because 133111502321 - 210 = 133111501297 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (133111502323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9507964445 + ... + 9507964458.
It is an arithmetic number, because the mean of its divisors is an integer number (38031857808).
Almost surely, 2133111502321 is an apocalyptic number.
It is an amenable number.
133111502321 is a deficient number, since it is larger than the sum of its proper divisors (19015928911).
133111502321 is an equidigital number, since it uses as much as digits as its factorization.
133111502321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19015928910.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 133111502321 its reverse (123205111331), we get a palindrome (256316613652).
The spelling of 133111502321 in words is "one hundred thirty-three billion, one hundred eleven million, five hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •