Base | Representation |
---|---|
bin | 11110000001100111011010… |
… | …110111100001111000011111 |
3 | 122022120002102200210122000101 |
4 | 132001213122313201320133 |
5 | 114302021400011132221 |
6 | 1144504015410241531 |
7 | 36546321413513545 |
oct | 3601473267417037 |
9 | 568502380718011 |
10 | 132052441505311 |
11 | 390921426a2148 |
12 | 129887935862a7 |
13 | 588b651647972 |
14 | 248752d723d95 |
15 | 103eec143ed91 |
hex | 7819dade1e1f |
132052441505311 has 16 divisors (see below), whose sum is σ = 139943959672608. Its totient is φ = 124174714752000.
The previous prime is 132052441505191. The next prime is 132052441505323. The reversal of 132052441505311 is 113505144250231.
It is a cyclic number.
It is not a de Polignac number, because 132052441505311 - 29 = 132052441504799 is a prime.
It is a super-3 number, since 3×1320524415053113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132052441509311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 95893696 + ... + 97261018.
It is an arithmetic number, because the mean of its divisors is an integer number (8746497479538).
Almost surely, 2132052441505311 is an apocalyptic number.
132052441505311 is a deficient number, since it is larger than the sum of its proper divisors (7891518167297).
132052441505311 is a wasteful number, since it uses less digits than its factorization.
132052441505311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1372362.
The product of its (nonzero) digits is 72000, while the sum is 37.
Adding to 132052441505311 its reverse (113505144250231), we get a palindrome (245557585755542).
The spelling of 132052441505311 in words is "one hundred thirty-two trillion, fifty-two billion, four hundred forty-one million, five hundred five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •