Base | Representation |
---|---|
bin | 111101100000111010… |
… | …1010100110000001001 |
3 | 110121222100100010002002 |
4 | 1323001311110300021 |
5 | 4131020324001301 |
6 | 140404130520345 |
7 | 12354404655242 |
oct | 1730165246011 |
9 | 417870303062 |
10 | 132101000201 |
11 | 51029630735 |
12 | 217284360b5 |
13 | c5c3252a11 |
14 | 6572535cc9 |
15 | 368252716b |
hex | 1ec1d54c09 |
132101000201 has 8 divisors (see below), whose sum is σ = 133199469408. Its totient is φ = 131006988000.
The previous prime is 132101000191. The next prime is 132101000203. The reversal of 132101000201 is 102000101231.
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 132101000201 - 218 = 132100738057 is a prime.
It is a super-3 number, since 3×1321010002013 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132101000203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1054715 + ... + 1173296.
It is an arithmetic number, because the mean of its divisors is an integer number (16649933676).
Almost surely, 2132101000201 is an apocalyptic number.
It is an amenable number.
132101000201 is a deficient number, since it is larger than the sum of its proper divisors (1098469207).
132101000201 is a wasteful number, since it uses less digits than its factorization.
132101000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2228503.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 132101000201 its reverse (102000101231), we get a palindrome (234101101432).
The spelling of 132101000201 in words is "one hundred thirty-two billion, one hundred one million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •