Base | Representation |
---|---|
bin | 11000111111010001… |
… | …00010110111001101 |
3 | 1021121221212022121012 |
4 | 30133220202313031 |
5 | 204433344433031 |
6 | 10055115215005 |
7 | 653310631553 |
oct | 143750426715 |
9 | 37557768535 |
10 | 13415624141 |
11 | 5764851a87 |
12 | 2724a47465 |
13 | 135a523a4a |
14 | 913a39bd3 |
15 | 537b9eb2b |
hex | 31fa22dcd |
13415624141 has 4 divisors (see below), whose sum is σ = 13878231900. Its totient is φ = 12953016384.
The previous prime is 13415624113. The next prime is 13415624179. The reversal of 13415624141 is 14142651431.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4688140900 + 8727483241 = 68470^2 + 93421^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13415624141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13415624098 and 13415624107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13415624111) 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 in 3 ways as a sum of consecutive naturals, for example, 231303836 + ... + 231303893.
It is an arithmetic number, because the mean of its divisors is an integer number (3469557975).
Almost surely, 213415624141 is an apocalyptic number.
It is an amenable number.
13415624141 is a deficient number, since it is larger than the sum of its proper divisors (462607759).
13415624141 is an equidigital number, since it uses as much as digits as its factorization.
13415624141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462607758.
The product of its digits is 11520, while the sum is 32.
The spelling of 13415624141 in words is "thirteen billion, four hundred fifteen million, six hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •