Base | Representation |
---|---|
bin | 11110010000000011010001… |
… | …111111110100111101001111 |
3 | 122110001220221002102002000012 |
4 | 132100003101333310331033 |
5 | 114414244443103143043 |
6 | 1150543433433223435 |
7 | 40011100001640335 |
oct | 3620032177647517 |
9 | 573056832362005 |
10 | 133044430131023 |
11 | 3943490a390a54 |
12 | 12b08a9a561b7b |
13 | 5931060c1a138 |
14 | 24bd555b81b55 |
15 | 105abce6b0a18 |
hex | 7900d1ff4f4f |
133044430131023 has 8 divisors (see below), whose sum is σ = 136766491176096. Its totient is φ = 129373707859200.
The previous prime is 133044430130923. The next prime is 133044430131043. The reversal of 133044430131023 is 320131034440331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133044430131023 - 224 = 133044413353807 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 (133044430131043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12834688058 + ... + 12834698423.
It is an arithmetic number, because the mean of its divisors is an integer number (17095811397012).
Almost surely, 2133044430131023 is an apocalyptic number.
133044430131023 is a deficient number, since it is larger than the sum of its proper divisors (3722061045073).
133044430131023 is an equidigital number, since it uses as much as digits as its factorization.
133044430131023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25669386625.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 133044430131023 its reverse (320131034440331), we get a palindrome (453175464571354).
The spelling of 133044430131023 in words is "one hundred thirty-three trillion, forty-four billion, four hundred thirty million, one hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •