Base | Representation |
---|---|
bin | 111101111011110101… |
… | …1101110001010010101 |
3 | 110201022022100020122101 |
4 | 1323313223232022111 |
5 | 4134343114440001 |
6 | 141033523002101 |
7 | 12415655123044 |
oct | 1736753561225 |
9 | 421268306571 |
10 | 133004452501 |
11 | 51452600828 |
12 | 2193ab09331 |
13 | c70848788b |
14 | 661a51055b |
15 | 36d69d6a01 |
hex | 1ef7aee295 |
133004452501 has 2 divisors, whose sum is σ = 133004452502. Its totient is φ = 133004452500.
The previous prime is 133004452487. The next prime is 133004452507. The reversal of 133004452501 is 105254400331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89669703601 + 43334748900 = 299449^2 + 208170^2 .
It is an emirp because it is prime and its reverse (105254400331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133004452501 - 29 = 133004451989 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133004452501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133004452507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66502226250 + 66502226251.
It is an arithmetic number, because the mean of its divisors is an integer number (66502226251).
Almost surely, 2133004452501 is an apocalyptic number.
It is an amenable number.
133004452501 is a deficient number, since it is larger than the sum of its proper divisors (1).
133004452501 is an equidigital number, since it uses as much as digits as its factorization.
133004452501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 133004452501 its reverse (105254400331), we get a palindrome (238258852832).
The spelling of 133004452501 in words is "one hundred thirty-three billion, four million, four hundred fifty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •