Base | Representation |
---|---|
bin | 111101101011010100… |
… | …0110100011010010101 |
3 | 110122212200010100112012 |
4 | 1323112220310122111 |
5 | 4132224202343131 |
6 | 140502520034005 |
7 | 12366143536304 |
oct | 1732650643225 |
9 | 418780110465 |
10 | 132450043541 |
11 | 51198662102 |
12 | 21805302905 |
13 | c64a66263a |
14 | 65a6a3443b |
15 | 36a2ec252b |
hex | 1ed6a34695 |
132450043541 has 4 divisors (see below), whose sum is σ = 134315537184. Its totient is φ = 130584549900.
The previous prime is 132450043513. The next prime is 132450043567. The reversal of 132450043541 is 145340054231.
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 132450043541 - 218 = 132449781397 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132450043498 and 132450043507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132450043241) 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, 932746715 + ... + 932746856.
It is an arithmetic number, because the mean of its divisors is an integer number (33578884296).
Almost surely, 2132450043541 is an apocalyptic number.
It is an amenable number.
132450043541 is a deficient number, since it is larger than the sum of its proper divisors (1865493643).
132450043541 is an equidigital number, since it uses as much as digits as its factorization.
132450043541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1865493642.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 132450043541 its reverse (145340054231), we get a palindrome (277790097772).
The spelling of 132450043541 in words is "one hundred thirty-two billion, four hundred fifty million, forty-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •