Base | Representation |
---|---|
bin | 10111001110010110011011… |
… | …111000001001001000011101 |
3 | 111101122121101002221022110222 |
4 | 113032112123320021020131 |
5 | 101341440221001432000 |
6 | 1001123011233211125 |
7 | 30341313646525436 |
oct | 2716263370111035 |
9 | 441577332838428 |
10 | 102141232452125 |
11 | 2a5aa9429a2679 |
12 | b5577a4100aa5 |
13 | 44cbb526b68c9 |
14 | 1b3193a86a48d |
15 | bc1ddb7b9a85 |
hex | 5ce59be0921d |
102141232452125 has 8 divisors (see below), whose sum is σ = 127472258100408. Its totient is φ = 81712985961600.
The previous prime is 102141232452089. The next prime is 102141232452131. The reversal of 102141232452125 is 521254232141201.
It can be written as a sum of positive squares in 4 ways, for example, as 338338825561 + 101802893626564 = 581669^2 + 10089742^2 .
It is not a de Polignac number, because 102141232452125 - 230 = 102140158710301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 408564929684 + ... + 408564929933.
It is an arithmetic number, because the mean of its divisors is an integer number (15934032262551).
Almost surely, 2102141232452125 is an apocalyptic number.
It is an amenable number.
102141232452125 is a deficient number, since it is larger than the sum of its proper divisors (25331025648283).
102141232452125 is an frugal number, since it uses more digits than its factorization.
102141232452125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 817129859632 (or 817129859622 counting only the distinct ones).
The product of its (nonzero) digits is 38400, while the sum is 35.
Adding to 102141232452125 its reverse (521254232141201), we get a palindrome (623395464593326).
The spelling of 102141232452125 in words is "one hundred two trillion, one hundred forty-one billion, two hundred thirty-two million, four hundred fifty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •