Base | Representation |
---|---|
bin | 10111001100011111001110… |
… | …011001011101111111100111 |
3 | 111101012100222110200100122002 |
4 | 113030133032121131333213 |
5 | 101332341044120431442 |
6 | 1000544121550355515 |
7 | 30326132651431445 |
oct | 2714371631357747 |
9 | 441170873610562 |
10 | 102013231030247 |
11 | 2a5606284898a9 |
12 | b536a207bbb9b |
13 | 44bca638ac1a4 |
14 | 1b296769a9b95 |
15 | bbd8e9137732 |
hex | 5cc7ce65dfe7 |
102013231030247 has 2 divisors, whose sum is σ = 102013231030248. Its totient is φ = 102013231030246.
The previous prime is 102013231030159. The next prime is 102013231030259. The reversal of 102013231030247 is 742030132310201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102013231030247 - 28 = 102013231029991 is a prime.
It is a super-3 number, since 3×1020132310302473 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102013231530247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51006615515123 + 51006615515124.
It is an arithmetic number, because the mean of its divisors is an integer number (51006615515124).
Almost surely, 2102013231030247 is an apocalyptic number.
102013231030247 is a deficient number, since it is larger than the sum of its proper divisors (1).
102013231030247 is an equidigital number, since it uses as much as digits as its factorization.
102013231030247 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 29.
Adding to 102013231030247 its reverse (742030132310201), we get a palindrome (844043363340448).
The spelling of 102013231030247 in words is "one hundred two trillion, thirteen billion, two hundred thirty-one million, thirty thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •