Base | Representation |
---|---|
bin | 1100001110100110101110… |
… | …0101000000100001010011 |
3 | 1202121100000211022000212022 |
4 | 3003221223211000201103 |
5 | 3230240431420000201 |
6 | 44332323304122055 |
7 | 2555241635420144 |
oct | 303515345004123 |
9 | 52540024260768 |
10 | 13445052500051 |
11 | 4314018696207 |
12 | 16118a8a6632b |
13 | 766b2b059bc3 |
14 | 346a5b801acb |
15 | 184b0b3de41b |
hex | c3a6b940853 |
13445052500051 has 2 divisors, whose sum is σ = 13445052500052. Its totient is φ = 13445052500050.
The previous prime is 13445052500021. The next prime is 13445052500057. The reversal of 13445052500051 is 15000525054431.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13445052500051 - 26 = 13445052499987 is a prime.
It is a super-5 number, since 5×134450525000515 (a number of 67 digits) contains 55555 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13445052499984 and 13445052500020.
It is not a weakly prime, because it can be changed into another prime (13445052500057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6722526250025 + 6722526250026.
It is an arithmetic number, because the mean of its divisors is an integer number (6722526250026).
Almost surely, 213445052500051 is an apocalyptic number.
13445052500051 is a deficient number, since it is larger than the sum of its proper divisors (1).
13445052500051 is an equidigital number, since it uses as much as digits as its factorization.
13445052500051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60000, while the sum is 35.
Adding to 13445052500051 its reverse (15000525054431), we get a palindrome (28445577554482).
The spelling of 13445052500051 in words is "thirteen trillion, four hundred forty-five billion, fifty-two million, five hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •