Base | Representation |
---|---|
bin | 11110000101010000111111… |
… | …000001110101110001110011 |
3 | 122100110001202120122211210021 |
4 | 132011100333001311301303 |
5 | 114320124003342024021 |
6 | 1145215133110544311 |
7 | 36603410243026102 |
oct | 3605207701656163 |
9 | 570401676584707 |
10 | 132303230033011 |
11 | 39179537240984 |
12 | 12a09304068097 |
13 | 58a91aaba099b |
14 | 2495720b56039 |
15 | 104679d5b6c41 |
hex | 78543f075c73 |
132303230033011 has 4 divisors (see below), whose sum is σ = 132303267813024. Its totient is φ = 132303192253000.
The previous prime is 132303230032993. The next prime is 132303230033113. The reversal of 132303230033011 is 110330032303231.
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 132303230033011 - 25 = 132303230032979 is a prime.
It is a super-2 number, since 2×1323032300330112 (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 (132303230033311) 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, 13031440 + ... + 20842861.
It is an arithmetic number, because the mean of its divisors is an integer number (33075816953256).
Almost surely, 2132303230033011 is an apocalyptic number.
132303230033011 is a deficient number, since it is larger than the sum of its proper divisors (37780013).
132303230033011 is an equidigital number, since it uses as much as digits as its factorization.
132303230033011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37780012.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 132303230033011 its reverse (110330032303231), we get a palindrome (242633262336242).
The spelling of 132303230033011 in words is "one hundred thirty-two trillion, three hundred three billion, two hundred thirty million, thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •