Base | Representation |
---|---|
bin | 11110000011111110111011… |
… | …111111101110001010010001 |
3 | 122100010122100220021010202202 |
4 | 132003332323333232022101 |
5 | 114312203042333110210 |
6 | 1145110443203052545 |
7 | 36564141142552013 |
oct | 3603767377561221 |
9 | 570118326233682 |
10 | 132215132316305 |
11 | 39145139395445 |
12 | 129b4218371155 |
13 | 58a0aab20162c |
14 | 24913647581b3 |
15 | 10443442499a5 |
hex | 783fbbfee291 |
132215132316305 has 4 divisors (see below), whose sum is σ = 158658158779572. Its totient is φ = 105772105853040.
The previous prime is 132215132316299. The next prime is 132215132316329. The reversal of 132215132316305 is 503613231512231.
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 21641411033089 + 110573721283216 = 4652033^2 + 10515404^2 .
It is not a de Polignac number, because 132215132316305 - 210 = 132215132315281 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13221513231626 + ... + 13221513231635.
It is an arithmetic number, because the mean of its divisors is an integer number (39664539694893).
Almost surely, 2132215132316305 is an apocalyptic number.
It is an amenable number.
132215132316305 is a deficient number, since it is larger than the sum of its proper divisors (26443026463267).
132215132316305 is an equidigital number, since it uses as much as digits as its factorization.
132215132316305 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26443026463266.
The product of its (nonzero) digits is 97200, while the sum is 38.
Adding to 132215132316305 its reverse (503613231512231), we get a palindrome (635828363828536).
The spelling of 132215132316305 in words is "one hundred thirty-two trillion, two hundred fifteen billion, one hundred thirty-two million, three hundred sixteen thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •