Base | Representation |
---|---|
bin | 111101111100101000… |
… | …1011010101000110101 |
3 | 110201101011111122112101 |
4 | 1323321101122220311 |
5 | 4134421431024341 |
6 | 141040314222101 |
7 | 12416430534211 |
oct | 1737121325065 |
9 | 421334448471 |
10 | 133031111221 |
11 | 51466659928 |
12 | 21947a24931 |
13 | c710b5ca78 |
14 | 661dc8d941 |
15 | 36d9000831 |
hex | 1ef945aa35 |
133031111221 has 4 divisors (see below), whose sum is σ = 133225886592. Its totient is φ = 132836335852.
The previous prime is 133031111183. The next prime is 133031111263. The reversal of 133031111221 is 122111130331.
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 a cyclic number.
It is not a de Polignac number, because 133031111221 - 219 = 133030586933 is a prime.
It is a super-2 number, since 2×1330311112212 (a number of 23 digits) contains 22 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 (133031115221) 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, 97386661 + ... + 97388026.
It is an arithmetic number, because the mean of its divisors is an integer number (33306471648).
Almost surely, 2133031111221 is an apocalyptic number.
It is an amenable number.
133031111221 is a deficient number, since it is larger than the sum of its proper divisors (194775371).
133031111221 is an equidigital number, since it uses as much as digits as its factorization.
133031111221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194775370.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 133031111221 its reverse (122111130331), we get a palindrome (255142241552).
The spelling of 133031111221 in words is "one hundred thirty-three billion, thirty-one million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •