Base | Representation |
---|---|
bin | 11110000011000101101001… |
… | …110010010010111011101011 |
3 | 122022220202121020121200202220 |
4 | 132003011221302102323223 |
5 | 114310201110110214201 |
6 | 1145022311520125123 |
7 | 36556532662464114 |
oct | 3603055162227353 |
9 | 568822536550686 |
10 | 132153623523051 |
11 | 39121045271709 |
12 | 129a43111667a3 |
13 | 5898057cc3990 |
14 | 248c3ab75320b |
15 | 1042944312036 |
hex | 783169c92eeb |
132153623523051 has 16 divisors (see below), whose sum is σ = 189762856494624. Its totient is φ = 81323675069184.
The previous prime is 132153623523017. The next prime is 132153623523071. The reversal of 132153623523051 is 150325326351231.
It is not a de Polignac number, because 132153623523051 - 213 = 132153623514859 is a prime.
It is a super-2 number, since 2×1321536235230512 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132153623522994 and 132153623523012.
It is not an unprimeable number, because it can be changed into a prime (132153623523071) 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, 32023906 + ... + 35914311.
It is an arithmetic number, because the mean of its divisors is an integer number (11860178530914).
Almost surely, 2132153623523051 is an apocalyptic number.
132153623523051 is a deficient number, since it is larger than the sum of its proper divisors (57609232971573).
132153623523051 is a wasteful number, since it uses less digits than its factorization.
132153623523051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67988110.
The product of its (nonzero) digits is 486000, while the sum is 42.
Adding to 132153623523051 its reverse (150325326351231), we get a palindrome (282478949874282).
The spelling of 132153623523051 in words is "one hundred thirty-two trillion, one hundred fifty-three billion, six hundred twenty-three million, five hundred twenty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •