Base | Representation |
---|---|
bin | 10111001110101000111000… |
… | …101100001100001110010101 |
3 | 111101201111111202101010220222 |
4 | 113032220320230030032111 |
5 | 101342301304030224112 |
6 | 1001140045122404125 |
7 | 30342614613305420 |
oct | 2716507054141625 |
9 | 441644452333828 |
10 | 102161043211157 |
11 | 2a6082896180a7 |
12 | b55b5b2800645 |
13 | 450098bb03428 |
14 | 1b328999709b7 |
15 | bc269ab04372 |
hex | 5cea38b0c395 |
102161043211157 has 16 divisors (see below), whose sum is σ = 118245957004800. Its totient is φ = 86451726176640.
The previous prime is 102161043211103. The next prime is 102161043211219. The reversal of 102161043211157 is 751112340161201.
It is a cyclic number.
It is not a de Polignac number, because 102161043211157 - 26 = 102161043211093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102161043211457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 123629357 + ... + 124452962.
It is an arithmetic number, because the mean of its divisors is an integer number (7390372312800).
Almost surely, 2102161043211157 is an apocalyptic number.
It is an amenable number.
102161043211157 is a deficient number, since it is larger than the sum of its proper divisors (16084913793643).
102161043211157 is an equidigital number, since it uses as much as digits as its factorization.
102161043211157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248083076.
The product of its (nonzero) digits is 10080, while the sum is 35.
Adding to 102161043211157 its reverse (751112340161201), we get a palindrome (853273383372358).
The spelling of 102161043211157 in words is "one hundred two trillion, one hundred sixty-one billion, forty-three million, two hundred eleven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •