Base | Representation |
---|---|
bin | 111101100000111111… |
… | …0001011010110111101 |
3 | 110121222111201000122101 |
4 | 1323001332023112331 |
5 | 4131021422233041 |
6 | 140404252345101 |
7 | 12354433462420 |
oct | 1730176132675 |
9 | 417874630571 |
10 | 132103321021 |
11 | 5102a976371 |
12 | 21729175191 |
13 | c5c3886199 |
14 | 657297b9b7 |
15 | 3682834b31 |
hex | 1ec1f8b5bd |
132103321021 has 8 divisors (see below), whose sum is σ = 150978651264. Its totient is φ = 113228847600.
The previous prime is 132103321003. The next prime is 132103321067. The reversal of 132103321021 is 120123301231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132103321021 - 27 = 132103320893 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132103321021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132103331021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 159696 + ... + 538246.
It is an arithmetic number, because the mean of its divisors is an integer number (18872331408).
Almost surely, 2132103321021 is an apocalyptic number.
It is an amenable number.
132103321021 is a deficient number, since it is larger than the sum of its proper divisors (18875330243).
132103321021 is an equidigital number, since it uses as much as digits as its factorization.
132103321021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428411.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 132103321021 its reverse (120123301231), we get a palindrome (252226622252).
The spelling of 132103321021 in words is "one hundred thirty-two billion, one hundred three million, three hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •