Base | Representation |
---|---|
bin | 1100000111111100000001… |
… | …0110001000001011101001 |
3 | 1202012101101012101212100112 |
4 | 3001333000112020023221 |
5 | 3221401341144430031 |
6 | 44203541344344105 |
7 | 2544045323031122 |
oct | 301770026101351 |
9 | 52171335355315 |
10 | 13330510545641 |
11 | 427a48a74a573 |
12 | 15b3661015035 |
13 | 7590a5887213 |
14 | 3412b3311049 |
15 | 181b556bc62b |
hex | c1fc05882e9 |
13330510545641 has 2 divisors, whose sum is σ = 13330510545642. Its totient is φ = 13330510545640.
The previous prime is 13330510545619. The next prime is 13330510545691. The reversal of 13330510545641 is 14654501503331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11997882729616 + 1332627816025 = 3463796^2 + 1154395^2 .
It is a cyclic number.
It is not a de Polignac number, because 13330510545641 - 214 = 13330510529257 is a prime.
It is a super-2 number, since 2×133305105456412 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13330510545691) 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, 6665255272820 + 6665255272821.
It is an arithmetic number, because the mean of its divisors is an integer number (6665255272821).
Almost surely, 213330510545641 is an apocalyptic number.
It is an amenable number.
13330510545641 is a deficient number, since it is larger than the sum of its proper divisors (1).
13330510545641 is an equidigital number, since it uses as much as digits as its factorization.
13330510545641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 13330510545641 in words is "thirteen trillion, three hundred thirty billion, five hundred ten million, five hundred forty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •