Base | Representation |
---|---|
bin | 11110000101010000001000… |
… | …110011100110010101110111 |
3 | 122100102222102011220010222222 |
4 | 132011100020303212111313 |
5 | 114320120123001030403 |
6 | 1145214502532512555 |
7 | 36603345555466040 |
oct | 3605201063462567 |
9 | 570388364803888 |
10 | 132302320330103 |
11 | 3917910a7916a0 |
12 | 12a090ab47b75b |
13 | 58a909458aa41 |
14 | 2495675dd18c7 |
15 | 10467487c0338 |
hex | 785408ce6577 |
132302320330103 has 32 divisors (see below), whose sum is σ = 172122798292992. Its totient is φ = 98608830328800.
The previous prime is 132302320330099. The next prime is 132302320330153. The reversal of 132302320330103 is 301033023203231.
It is a happy number.
It is not a de Polignac number, because 132302320330103 - 22 = 132302320330099 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 (132302320330153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 115200650 + ... + 116343432.
It is an arithmetic number, because the mean of its divisors is an integer number (5378837446656).
Almost surely, 2132302320330103 is an apocalyptic number.
132302320330103 is a deficient number, since it is larger than the sum of its proper divisors (39820477962889).
132302320330103 is a wasteful number, since it uses less digits than its factorization.
132302320330103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1208195.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 132302320330103 its reverse (301033023203231), we get a palindrome (433335343533334).
The spelling of 132302320330103 in words is "one hundred thirty-two trillion, three hundred two billion, three hundred twenty million, three hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •