Base | Representation |
---|---|
bin | 1000100111011101110110… |
… | …10000100001010111010101 |
3 | 2111002102201121000020110112 |
4 | 10103232323100201113111 |
5 | 4440422000024204023 |
6 | 104144411414532405 |
7 | 3663652053030524 |
oct | 423567320412725 |
9 | 74072647006415 |
10 | 18948242413013 |
11 | 60459a4953a71 |
12 | 2160368067105 |
13 | a75a720b83a4 |
14 | 497157ccc4bb |
15 | 22cd497ed478 |
hex | 113bbb4215d5 |
18948242413013 has 2 divisors, whose sum is σ = 18948242413014. Its totient is φ = 18948242413012.
The previous prime is 18948242412929. The next prime is 18948242413021. The reversal of 18948242413013 is 31031424284981.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16542709656529 + 2405532756484 = 4067273^2 + 1550978^2 .
It is a cyclic number.
It is not a de Polignac number, because 18948242413013 - 228 = 18947973977557 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (18948242418013) 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, 9474121206506 + 9474121206507.
It is an arithmetic number, because the mean of its divisors is an integer number (9474121206507).
Almost surely, 218948242413013 is an apocalyptic number.
It is an amenable number.
18948242413013 is a deficient number, since it is larger than the sum of its proper divisors (1).
18948242413013 is an equidigital number, since it uses as much as digits as its factorization.
18948242413013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1327104, while the sum is 50.
Adding to 18948242413013 its reverse (31031424284981), we get a palindrome (49979666697994).
The spelling of 18948242413013 in words is "eighteen trillion, nine hundred forty-eight billion, two hundred forty-two million, four hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •