Base | Representation |
---|---|
bin | 11110000010100000110110… |
… | …001010000000111101101011 |
3 | 122022202222120222001210202021 |
4 | 132002200312022000331223 |
5 | 114304024140232320021 |
6 | 1144552214134045311 |
7 | 36553633423400341 |
oct | 3602406612007553 |
9 | 568688528053667 |
10 | 132114102620011 |
11 | 391063047a3276 |
12 | 129987217a9837 |
13 | 58943ca288055 |
14 | 248a4dca59991 |
15 | 10418ce914c41 |
hex | 782836280f6b |
132114102620011 has 4 divisors (see below), whose sum is σ = 132114132309832. Its totient is φ = 132114072930192.
The previous prime is 132114102619987. The next prime is 132114102620021. The reversal of 132114102620011 is 110026201411231.
It is a happy number.
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 132114102620011 - 25 = 132114102619979 is a prime.
It is a super-3 number, since 3×1321141026200113 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132114102620021) 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, 6669345 + ... + 17570098.
It is an arithmetic number, because the mean of its divisors is an integer number (33028533077458).
Almost surely, 2132114102620011 is an apocalyptic number.
132114102620011 is a deficient number, since it is larger than the sum of its proper divisors (29689821).
132114102620011 is an equidigital number, since it uses as much as digits as its factorization.
132114102620011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29689820.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 132114102620011 in words is "one hundred thirty-two trillion, one hundred fourteen billion, one hundred two million, six hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •