Base | Representation |
---|---|
bin | 10111001100011111100101… |
… | …001101000010000100010111 |
3 | 111101012101222010122020220201 |
4 | 113030133211031002010113 |
5 | 101332342340043133403 |
6 | 1000544223535241331 |
7 | 30326145305550535 |
oct | 2714374515020427 |
9 | 441171863566821 |
10 | 102013613646103 |
11 | 2a560804460855 |
12 | b536b08979247 |
13 | 44bcac4c44bc3 |
14 | 1b296b1727155 |
15 | bbd91ca1521d |
hex | 5cc7e5342117 |
102013613646103 has 2 divisors, whose sum is σ = 102013613646104. Its totient is φ = 102013613646102.
The previous prime is 102013613646067. The next prime is 102013613646127. The reversal of 102013613646103 is 301646316310201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102013613646103 - 213 = 102013613637911 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102013613646163) 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 as a sum of consecutive naturals, namely, 51006806823051 + 51006806823052.
It is an arithmetic number, because the mean of its divisors is an integer number (51006806823052).
Almost surely, 2102013613646103 is an apocalyptic number.
102013613646103 is a deficient number, since it is larger than the sum of its proper divisors (1).
102013613646103 is an equidigital number, since it uses as much as digits as its factorization.
102013613646103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 37.
Adding to 102013613646103 its reverse (301646316310201), we get a palindrome (403659929956304).
The spelling of 102013613646103 in words is "one hundred two trillion, thirteen billion, six hundred thirteen million, six hundred forty-six thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •