Base | Representation |
---|---|
bin | 11110000010100111010010… |
… | …000011000010001110111101 |
3 | 122022210122102120011122101021 |
4 | 132002213102003002032331 |
5 | 114304132313312100242 |
6 | 1144555315551344141 |
7 | 36554266603601161 |
oct | 3602472203021675 |
9 | 568718376148337 |
10 | 132121013003197 |
11 | 391092304a8459 |
12 | 12999b2bb22051 |
13 | 5894c5bb4459a |
14 | 248a996728ca1 |
15 | 1041b8642ab67 |
hex | 7829d20c23bd |
132121013003197 has 4 divisors (see below), whose sum is σ = 132141273861276. Its totient is φ = 132100752145120.
The previous prime is 132121013003171. The next prime is 132121013003251. The reversal of 132121013003197 is 791300310121231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 117518304823396 + 14602708179801 = 10840586^2 + 3821349^2 .
It is a cyclic number.
It is not a de Polignac number, because 132121013003197 - 235 = 132086653264829 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 (132121013003107) 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, 10130419258 + ... + 10130432299.
It is an arithmetic number, because the mean of its divisors is an integer number (33035318465319).
Almost surely, 2132121013003197 is an apocalyptic number.
It is an amenable number.
132121013003197 is a deficient number, since it is larger than the sum of its proper divisors (20260858079).
132121013003197 is an equidigital number, since it uses as much as digits as its factorization.
132121013003197 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20260858078.
The product of its (nonzero) digits is 6804, while the sum is 34.
The spelling of 132121013003197 in words is "one hundred thirty-two trillion, one hundred twenty-one billion, thirteen million, three thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •