Base | Representation |
---|---|
bin | 11110000010101111111111… |
… | …010111110011001110100001 |
3 | 122022211112120012111210011202 |
4 | 132002233333113303032201 |
5 | 114304310441004343230 |
6 | 1145003503450050545 |
7 | 36555050402356154 |
oct | 3602577727631641 |
9 | 568745505453152 |
10 | 132130363356065 |
11 | 39112199534a08 |
12 | 1299b8bb419a55 |
13 | 5895abc072569 |
14 | 248b20249dc9b |
15 | 1042032260a45 |
hex | 782bff5f33a1 |
132130363356065 has 8 divisors (see below), whose sum is σ = 158559655546728. Its totient is φ = 105702144338560.
The previous prime is 132130363355989. The next prime is 132130363356097. The reversal of 132130363356065 is 560653363031231.
It can be written as a sum of positive squares in 4 ways, for example, as 33682893841 + 132096680462224 = 183529^2 + 11493332^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132130363356065 - 246 = 61761619178401 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 268022396 + ... + 268514925.
It is an arithmetic number, because the mean of its divisors is an integer number (19819956943341).
Almost surely, 2132130363356065 is an apocalyptic number.
It is an amenable number.
132130363356065 is a deficient number, since it is larger than the sum of its proper divisors (26429292190663).
132130363356065 is an equidigital number, since it uses as much as digits as its factorization.
132130363356065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 536586579.
The product of its (nonzero) digits is 2624400, while the sum is 47.
The spelling of 132130363356065 in words is "one hundred thirty-two trillion, one hundred thirty billion, three hundred sixty-three million, three hundred fifty-six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •