Base | Representation |
---|---|
bin | 11110000000111000011100… |
… | …111111010000100000101011 |
3 | 122022101021021010022200220221 |
4 | 132000320130333100200223 |
5 | 114300210104333020021 |
6 | 1144424515314230511 |
7 | 36542554615251652 |
oct | 3600703477204053 |
9 | 568337233280827 |
10 | 132002011220011 |
11 | 39072814059409 |
12 | 1297aa5a585437 |
13 | 58869756c186a |
14 | 2484d07bc8199 |
15 | 103da1de03241 |
hex | 780e1cfd082b |
132002011220011 has 8 divisors (see below), whose sum is σ = 134813442000960. Its totient is φ = 129190700328768.
The previous prime is 132002011219997. The next prime is 132002011220083. The reversal of 132002011220011 is 110022110200231.
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 132002011220011 - 233 = 131993421285419 is a prime.
It is a super-2 number, since 2×1320020112200112 (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 (132002011226011) 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, 27745176 + ... + 32152741.
It is an arithmetic number, because the mean of its divisors is an integer number (16851680250120).
Almost surely, 2132002011220011 is an apocalyptic number.
132002011220011 is a deficient number, since it is larger than the sum of its proper divisors (2811430780949).
132002011220011 is an equidigital number, since it uses as much as digits as its factorization.
132002011220011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59944853.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 132002011220011 its reverse (110022110200231), we get a palindrome (242024121420242).
The spelling of 132002011220011 in words is "one hundred thirty-two trillion, two billion, eleven million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •