Base | Representation |
---|---|
bin | 111101100010100000… |
… | …1011011010011010011 |
3 | 110122010002000102001012 |
4 | 1323011001123103103 |
5 | 4131123023120103 |
6 | 140413321401135 |
7 | 12355624516205 |
oct | 1730501332323 |
9 | 418102012035 |
10 | 132154504403 |
11 | 51056855189 |
12 | 217423391ab |
13 | c6013670cc |
14 | 65796a2775 |
15 | 36870952d8 |
hex | 1ec505b4d3 |
132154504403 has 4 divisors (see below), whose sum is σ = 133119135960. Its totient is φ = 131189872848.
The previous prime is 132154504397. The next prime is 132154504411. The reversal of 132154504403 is 304405451231.
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 132154504403 - 228 = 131886068947 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132154504403.
It is not an unprimeable number, because it can be changed into a prime (132154504003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 482315573 + ... + 482315846.
It is an arithmetic number, because the mean of its divisors is an integer number (33279783990).
Almost surely, 2132154504403 is an apocalyptic number.
132154504403 is a deficient number, since it is larger than the sum of its proper divisors (964631557).
132154504403 is an equidigital number, since it uses as much as digits as its factorization.
132154504403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 964631556.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 132154504403 its reverse (304405451231), we get a palindrome (436559955634).
The spelling of 132154504403 in words is "one hundred thirty-two billion, one hundred fifty-four million, five hundred four thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •