Base | Representation |
---|---|
bin | 111101011110111001… |
… | …1000100111001101001 |
3 | 110121210121221200202210 |
4 | 1322331303010321221 |
5 | 4130401011131441 |
6 | 140353311515333 |
7 | 12352623356610 |
oct | 1727563047151 |
9 | 417717850683 |
10 | 132033302121 |
11 | 50aa43a2106 |
12 | 21709828b49 |
13 | c5b220bb96 |
14 | 6567552877 |
15 | 367b603616 |
hex | 1ebdcc4e69 |
132033302121 has 8 divisors (see below), whose sum is σ = 201193603264. Its totient is φ = 75447601200.
The previous prime is 132033302099. The next prime is 132033302131. The reversal of 132033302121 is 121203330231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132033302121 - 213 = 132033293929 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 6287300101 = 132033302121 / (1 + 3 + 2 + 0 + 3 + 3 + 3 + 0 + 2 + 1 + 2 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132033302131) 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, 3143650030 + ... + 3143650071.
It is an arithmetic number, because the mean of its divisors is an integer number (25149200408).
Almost surely, 2132033302121 is an apocalyptic number.
It is an amenable number.
132033302121 is a deficient number, since it is larger than the sum of its proper divisors (69160301143).
132033302121 is an equidigital number, since it uses as much as digits as its factorization.
132033302121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6287300111.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 132033302121 its reverse (121203330231), we get a palindrome (253236632352).
The spelling of 132033302121 in words is "one hundred thirty-two billion, thirty-three million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •