Base | Representation |
---|---|
bin | 111101100111001001… |
… | …0100110010101111101 |
3 | 110122111220121110022012 |
4 | 1323032102212111331 |
5 | 4131432330013041 |
6 | 140440554301005 |
7 | 12362523311132 |
oct | 1731622462575 |
9 | 418456543265 |
10 | 132310001021 |
11 | 51126601090 |
12 | 21786427765 |
13 | c62763bb43 |
14 | 65921bc589 |
15 | 3695a5d3eb |
hex | 1ece4a657d |
132310001021 has 8 divisors (see below), whose sum is σ = 144411141600. Its totient is φ = 120221020240.
The previous prime is 132310001017. The next prime is 132310001113. The reversal of 132310001021 is 120100013231.
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 132310001021 - 22 = 132310001017 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 132310000987 and 132310001005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132310001821) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3017186 + ... + 3060723.
It is an arithmetic number, because the mean of its divisors is an integer number (18051392700).
Almost surely, 2132310001021 is an apocalyptic number.
132310001021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
132310001021 is a deficient number, since it is larger than the sum of its proper divisors (12101140579).
132310001021 is a wasteful number, since it uses less digits than its factorization.
132310001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6079899.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 132310001021 its reverse (120100013231), we get a palindrome (252410014252).
The spelling of 132310001021 in words is "one hundred thirty-two billion, three hundred ten million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •