Base | Representation |
---|---|
bin | 111101111111000101… |
… | …1000001011000111101 |
3 | 110201120220012100011210 |
4 | 1323332023001120331 |
5 | 4140104002233041 |
6 | 141052412235033 |
7 | 12421446363012 |
oct | 1737613013075 |
9 | 421526170153 |
10 | 133113321021 |
11 | 514a8aaa30a |
12 | 2196b46ba79 |
13 | c724bb4c15 |
14 | 662ab6d709 |
15 | 36e133e016 |
hex | 1efe2c163d |
133113321021 has 4 divisors (see below), whose sum is σ = 177484428032. Its totient is φ = 88742214012.
The previous prime is 133113321017. The next prime is 133113321071. The reversal of 133113321021 is 120123311331.
It is a happy number.
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: 120123311331 = 3 ⋅40041103777.
It is not a de Polignac number, because 133113321021 - 22 = 133113321017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133113321071) 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, 22185553501 + ... + 22185553506.
It is an arithmetic number, because the mean of its divisors is an integer number (44371107008).
Almost surely, 2133113321021 is an apocalyptic number.
It is an amenable number.
133113321021 is a deficient number, since it is larger than the sum of its proper divisors (44371107011).
133113321021 is an equidigital number, since it uses as much as digits as its factorization.
133113321021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44371107010.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 133113321021 its reverse (120123311331), we get a palindrome (253236632352).
The spelling of 133113321021 in words is "one hundred thirty-three billion, one hundred thirteen million, three hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •