Base | Representation |
---|---|
bin | 111101111110111111… |
… | …0110100001010001101 |
3 | 110201120200011202201020 |
4 | 1323331332310022031 |
5 | 4140102142333401 |
6 | 141052215504353 |
7 | 12421410234546 |
oct | 1737576641215 |
9 | 421520152636 |
10 | 133110121101 |
11 | 514a7214151 |
12 | 2196a3880b9 |
13 | c724334589 |
14 | 662a5794cd |
15 | 36e0e0ad36 |
hex | 1efdfb428d |
133110121101 has 4 divisors (see below), whose sum is σ = 177480161472. Its totient is φ = 88740080732.
The previous prime is 133110121099. The next prime is 133110121103. The reversal of 133110121101 is 101121011331.
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.
It is an interprime number because it is at equal distance from previous prime (133110121099) and next prime (133110121103).
It is a cyclic number.
It is not a de Polignac number, because 133110121101 - 21 = 133110121099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133110121103) 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, 22185020181 + ... + 22185020186.
It is an arithmetic number, because the mean of its divisors is an integer number (44370040368).
Almost surely, 2133110121101 is an apocalyptic number.
It is an amenable number.
133110121101 is a deficient number, since it is larger than the sum of its proper divisors (44370040371).
133110121101 is an equidigital number, since it uses as much as digits as its factorization.
133110121101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44370040370.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 133110121101 its reverse (101121011331), we get a palindrome (234231132432).
The spelling of 133110121101 in words is "one hundred thirty-three billion, one hundred ten million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •