Base | Representation |
---|---|
bin | 111101101101001111… |
… | …0100000110011001101 |
3 | 110200001011022120110012 |
4 | 1323122132200303031 |
5 | 4132342144410022 |
6 | 140513140323005 |
7 | 12400555150142 |
oct | 1733236406315 |
9 | 420034276405 |
10 | 132514450637 |
11 | 51220a53108 |
12 | 218229a3465 |
13 | c65aac354a |
14 | 65b13dc3c9 |
15 | 36a8995de2 |
hex | 1eda7a0ccd |
132514450637 has 4 divisors (see below), whose sum is σ = 132515793696. Its totient is φ = 132513107580.
The previous prime is 132514450633. The next prime is 132514450703. The reversal of 132514450637 is 736054415231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 132514450637 - 22 = 132514450633 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132514450594 and 132514450603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132514450633) 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, 510689 + ... + 725142.
It is an arithmetic number, because the mean of its divisors is an integer number (33128948424).
Almost surely, 2132514450637 is an apocalyptic number.
It is an amenable number.
132514450637 is a deficient number, since it is larger than the sum of its proper divisors (1343059).
132514450637 is a wasteful number, since it uses less digits than its factorization.
132514450637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1343058.
The product of its (nonzero) digits is 302400, while the sum is 41.
Adding to 132514450637 its reverse (736054415231), we get a palindrome (868568865868).
The spelling of 132514450637 in words is "one hundred thirty-two billion, five hundred fourteen million, four hundred fifty thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •