Base | Representation |
---|---|
bin | 111110001010110001… |
… | …0000000000111110111 |
3 | 110202121012121221000221 |
4 | 1330111202000013313 |
5 | 4141404314033421 |
6 | 141155332115211 |
7 | 12434245440613 |
oct | 1742542000767 |
9 | 422535557027 |
10 | 133505221111 |
11 | 5168a242689 |
12 | 21a5a765b07 |
13 | c78814b772 |
14 | 6666c26343 |
15 | 3715952841 |
hex | 1f158801f7 |
133505221111 has 4 divisors (see below), whose sum is σ = 133524227032. Its totient is φ = 133486215192.
The previous prime is 133505221081. The next prime is 133505221169. The reversal of 133505221111 is 111122505331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111122505331 = 77263 ⋅1438237.
It is a cyclic number.
It is not a de Polignac number, because 133505221111 - 223 = 133496832503 is a prime.
It is a super-4 number, since 4×1335052211114 (a number of 46 digits) contains 4444 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 (133505227111) 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, 9492420 + ... + 9506473.
It is an arithmetic number, because the mean of its divisors is an integer number (33381056758).
Almost surely, 2133505221111 is an apocalyptic number.
133505221111 is a deficient number, since it is larger than the sum of its proper divisors (19005921).
133505221111 is an equidigital number, since it uses as much as digits as its factorization.
133505221111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19005920.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 133505221111 its reverse (111122505331), we get a palindrome (244627726442).
The spelling of 133505221111 in words is "one hundred thirty-three billion, five hundred five million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •