Base | Representation |
---|---|
bin | 111101011110001111… |
… | …0110000111101000001 |
3 | 110121202002100210210121 |
4 | 1322330132300331001 |
5 | 4130324331402241 |
6 | 140351202100241 |
7 | 12352234455100 |
oct | 1727436607501 |
9 | 417662323717 |
10 | 132011200321 |
11 | 50a92976760 |
12 | 2170234a681 |
13 | c5aa770bb0 |
14 | 656463c037 |
15 | 36796d9ad1 |
hex | 1ebc7b0f41 |
132011200321 has 48 divisors (see below), whose sum is σ = 184249900800. Its totient is φ = 92932600320.
The previous prime is 132011200319. The next prime is 132011200331. The reversal of 132011200321 is 123002110231.
It is not a de Polignac number, because 132011200321 - 21 = 132011200319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132011200295 and 132011200304.
It is not an unprimeable number, because it can be changed into a prime (132011200301) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 128905 + ... + 529753.
It is an arithmetic number, because the mean of its divisors is an integer number (3838539600).
Almost surely, 2132011200321 is an apocalyptic number.
132011200321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
132011200321 is a deficient number, since it is larger than the sum of its proper divisors (52238700479).
132011200321 is a wasteful number, since it uses less digits than its factorization.
132011200321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400934 (or 400927 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 132011200321 its reverse (123002110231), we get a palindrome (255013310552).
The spelling of 132011200321 in words is "one hundred thirty-two billion, eleven million, two hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •