Base | Representation |
---|---|
bin | 11110000001000001110000… |
… | …011000100101100011000101 |
3 | 122022102020001021112201010201 |
4 | 132001001300120211203011 |
5 | 114300341034034201201 |
6 | 1144433250431050501 |
7 | 36543360301125526 |
oct | 3601016030454305 |
9 | 568366037481121 |
10 | 132012000303301 |
11 | 39076a7a697548 |
12 | 12980987970a31 |
13 | 58878a8059131 |
14 | 24855b470884d |
15 | 103de05d56801 |
hex | 7810706258c5 |
132012000303301 has 4 divisors (see below), whose sum is σ = 132012049636192. Its totient is φ = 132011950970412.
The previous prime is 132012000303263. The next prime is 132012000303311. The reversal of 132012000303301 is 103303000210231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 132012000303301 - 235 = 131977640564933 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132012000303311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20407401 + ... + 26086126.
It is an arithmetic number, because the mean of its divisors is an integer number (33003012409048).
Almost surely, 2132012000303301 is an apocalyptic number.
It is an amenable number.
132012000303301 is a deficient number, since it is larger than the sum of its proper divisors (49332891).
132012000303301 is an equidigital number, since it uses as much as digits as its factorization.
132012000303301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49332890.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 132012000303301 its reverse (103303000210231), we get a palindrome (235315000513532).
The spelling of 132012000303301 in words is "one hundred thirty-two trillion, twelve billion, three hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •