Base | Representation |
---|---|
bin | 11110000010111001000100… |
… | …100011111100001110000001 |
3 | 122022212110201202020221210112 |
4 | 132002321010203330032001 |
5 | 114304440423202213441 |
6 | 1145012155210241105 |
7 | 36555544132341260 |
oct | 3602710443741601 |
9 | 568773652227715 |
10 | 132140114101121 |
11 | 39116342584aa5 |
12 | 129a1780a26195 |
13 | 58969b421b4a9 |
14 | 248b88949c5d7 |
15 | 10424032d54eb |
hex | 782e448fc381 |
132140114101121 has 16 divisors (see below), whose sum is σ = 151159699686528. Its totient is φ = 113156164684800.
The previous prime is 132140114101069. The next prime is 132140114101139. The reversal of 132140114101121 is 121101411041231.
It is a cyclic number.
It is not a de Polignac number, because 132140114101121 - 230 = 132139040359297 is a prime.
It is a super-2 number, since 2×1321401141011212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132140114101141) 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, 52569131 + ... + 55025391.
It is an arithmetic number, because the mean of its divisors is an integer number (9447481230408).
Almost surely, 2132140114101121 is an apocalyptic number.
It is an amenable number.
132140114101121 is a deficient number, since it is larger than the sum of its proper divisors (19019585585407).
132140114101121 is a wasteful number, since it uses less digits than its factorization.
132140114101121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2463512.
The product of its (nonzero) digits is 192, while the sum is 23.
Adding to 132140114101121 its reverse (121101411041231), we get a palindrome (253241525142352).
The spelling of 132140114101121 in words is "one hundred thirty-two trillion, one hundred forty billion, one hundred fourteen million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •