Base | Representation |
---|---|
bin | 1100010010000011101100… |
… | …0000110100010110101011 |
3 | 1202211000010120110110121222 |
4 | 3010200323000310112223 |
5 | 3232223421003430221 |
6 | 44415453133052255 |
7 | 2562441544441625 |
oct | 304407300642653 |
9 | 52730116413558 |
10 | 13504367248811 |
11 | 433719628792a |
12 | 16212a132708b |
13 | 76c5c183cb8a |
14 | 349887279c15 |
15 | 18642d8d49ab |
hex | c483b0345ab |
13504367248811 has 2 divisors, whose sum is σ = 13504367248812. Its totient is φ = 13504367248810.
The previous prime is 13504367248781. The next prime is 13504367248951. The reversal of 13504367248811 is 11884276340531.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13504367248811 - 26 = 13504367248747 is a prime.
It is not a weakly prime, because it can be changed into another prime (13504367241811) 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, 6752183624405 + 6752183624406.
It is an arithmetic number, because the mean of its divisors is an integer number (6752183624406).
Almost surely, 213504367248811 is an apocalyptic number.
13504367248811 is a deficient number, since it is larger than the sum of its proper divisors (1).
13504367248811 is an equidigital number, since it uses as much as digits as its factorization.
13504367248811 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3870720, while the sum is 53.
The spelling of 13504367248811 in words is "thirteen trillion, five hundred four billion, three hundred sixty-seven million, two hundred forty-eight thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •