Base | Representation |
---|---|
bin | 11110010001011100101010… |
… | …110110000110011101110001 |
3 | 122110102002200002112022220210 |
4 | 132101130222312012131301 |
5 | 114422333024432042113 |
6 | 1151055505431454333 |
7 | 40021035322440423 |
oct | 3621345266063561 |
9 | 573362602468823 |
10 | 133140410034033 |
11 | 39471592556746 |
12 | 12b23605b273a9 |
13 | 593a1188bc85c |
14 | 24c405cd3a813 |
15 | 105d44aa056c3 |
hex | 79172ad86771 |
133140410034033 has 4 divisors (see below), whose sum is σ = 177520546712048. Its totient is φ = 88760273356020.
The previous prime is 133140410033971. The next prime is 133140410034077. The reversal of 133140410034033 is 330430014041331.
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 not a de Polignac number, because 133140410034033 - 217 = 133140409902961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133140410034133) 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, 22190068339003 + ... + 22190068339008.
It is an arithmetic number, because the mean of its divisors is an integer number (44380136678012).
Almost surely, 2133140410034033 is an apocalyptic number.
It is an amenable number.
133140410034033 is a deficient number, since it is larger than the sum of its proper divisors (44380136678015).
133140410034033 is an equidigital number, since it uses as much as digits as its factorization.
133140410034033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44380136678014.
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 133140410034033 its reverse (330430014041331), we get a palindrome (463570424075364).
The spelling of 133140410034033 in words is "one hundred thirty-three trillion, one hundred forty billion, four hundred ten million, thirty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •