Base | Representation |
---|---|
bin | 11110001111100011100110… |
… | …100000001110111100001011 |
3 | 122102221200010110212112012001 |
4 | 132033203212200032330023 |
5 | 114413220312043311021 |
6 | 1150520050230531431 |
7 | 40005454031161234 |
oct | 3617434640167413 |
9 | 572850113775161 |
10 | 133010414432011 |
11 | 39421444410906 |
12 | 12b02386806b77 |
13 | 592aa9c8c7a9c |
14 | 24bba4a29808b |
15 | 1059d8d260091 |
hex | 78f8e680ef0b |
133010414432011 has 4 divisors (see below), whose sum is σ = 133010799480000. Its totient is φ = 133010029384024.
The previous prime is 133010414431841. The next prime is 133010414432053. The reversal of 133010414432011 is 110234414010331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 133010414432011 - 213 = 133010414423819 is a prime.
It is a super-2 number, since 2×1330104144320112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133010414432611) 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, 192005371 + ... + 192696868.
It is an arithmetic number, because the mean of its divisors is an integer number (33252699870000).
Almost surely, 2133010414432011 is an apocalyptic number.
133010414432011 is a deficient number, since it is larger than the sum of its proper divisors (385047989).
133010414432011 is an equidigital number, since it uses as much as digits as its factorization.
133010414432011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385047988.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 133010414432011 its reverse (110234414010331), we get a palindrome (243244828442342).
The spelling of 133010414432011 in words is "one hundred thirty-three trillion, ten billion, four hundred fourteen million, four hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •