Base | Representation |
---|---|
bin | 1011111101111100010010… |
… | …1110110000101010010001 |
3 | 1201120222010101021121122001 |
4 | 2333133010232300222101 |
5 | 3211043143031414141 |
6 | 43553021303114001 |
7 | 2525455653402661 |
oct | 277370456605221 |
9 | 51528111247561 |
10 | 13158785419921 |
11 | 4213678358969 |
12 | 1586316742901 |
13 | 745b393c73ab |
14 | 336c624d21a1 |
15 | 17c4546a8a31 |
hex | bf7c4bb0a91 |
13158785419921 has 2 divisors, whose sum is σ = 13158785419922. Its totient is φ = 13158785419920.
The previous prime is 13158785419789. The next prime is 13158785420113. The reversal of 13158785419921 is 12991458785131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13137253966225 + 21531453696 = 3624535^2 + 146736^2 .
It is an emirp because it is prime and its reverse (12991458785131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13158785419921 - 211 = 13158785417873 is a prime.
It is a super-3 number, since 3×131587854199213 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (13158785419621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6579392709960 + 6579392709961.
It is an arithmetic number, because the mean of its divisors is an integer number (6579392709961).
Almost surely, 213158785419921 is an apocalyptic number.
It is an amenable number.
13158785419921 is a deficient number, since it is larger than the sum of its proper divisors (1).
13158785419921 is an equidigital number, since it uses as much as digits as its factorization.
13158785419921 is an evil number, because the sum of its binary digits is even.
The product of its digits is 21772800, while the sum is 64.
The spelling of 13158785419921 in words is "thirteen trillion, one hundred fifty-eight billion, seven hundred eighty-five million, four hundred nineteen thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •