Base | Representation |
---|---|
bin | 111101111100010111… |
… | …1011011010100010111 |
3 | 110201100112201222011022 |
4 | 1323320233123110113 |
5 | 4134412140413421 |
6 | 141035355231355 |
7 | 12416262024212 |
oct | 1737057332427 |
9 | 421315658138 |
10 | 133022201111 |
11 | 514616235a8 |
12 | 21944a4855b |
13 | c70c060307 |
14 | 661ca10779 |
15 | 36d83407ab |
hex | 1ef8bdb517 |
133022201111 has 4 divisors (see below), whose sum is σ = 133025958072. Its totient is φ = 133018444152.
The previous prime is 133022201099. The next prime is 133022201141. The reversal of 133022201111 is 111102220331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111102220331 = 12071 ⋅9204061.
It is a cyclic number.
It is not a de Polignac number, because 133022201111 - 230 = 131948459287 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133022201111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133022201141) 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, 1824860 + ... + 1896353.
It is an arithmetic number, because the mean of its divisors is an integer number (33256489518).
Almost surely, 2133022201111 is an apocalyptic number.
133022201111 is a deficient number, since it is larger than the sum of its proper divisors (3756961).
133022201111 is an equidigital number, since it uses as much as digits as its factorization.
133022201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3756960.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 133022201111 its reverse (111102220331), we get a palindrome (244124421442).
The spelling of 133022201111 in words is "one hundred thirty-three billion, twenty-two million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •