Base | Representation |
---|---|
bin | 111101011110011100… |
… | …1001110001001100001 |
3 | 110121202120102011021121 |
4 | 1322330321032021201 |
5 | 4130333120320044 |
6 | 140352010452241 |
7 | 12352350431521 |
oct | 1727471161141 |
9 | 417676364247 |
10 | 132018135649 |
11 | 50a96883334 |
12 | 21704734081 |
13 | c5ac02b83a |
14 | 6565525681 |
15 | 367a109984 |
hex | 1ebce4e261 |
132018135649 has 3 divisors (see below), whose sum is σ = 132018498993. Its totient is φ = 132017772306.
The previous prime is 132018135629. The next prime is 132018135673. The reversal of 132018135649 is 946531810231.
The square root of 132018135649 is 363343.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 132018135649 - 27 = 132018135521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132018135629) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 181672 + ... + 545014.
It is an arithmetic number, because the mean of its divisors is an integer number (44006166331).
Almost surely, 2132018135649 is an apocalyptic number.
132018135649 is the 363343-rd square number.
132018135649 is the 181672-nd centered octagonal number.
It is an amenable number.
132018135649 is a deficient number, since it is larger than the sum of its proper divisors (363344).
132018135649 is an frugal number, since it uses more digits than its factorization.
132018135649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 726686 (or 363343 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 43.
The spelling of 132018135649 in words is "one hundred thirty-two billion, eighteen million, one hundred thirty-five thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •