Base | Representation |
---|---|
bin | 11000011111001011… |
… | …11011111110110110 |
3 | 1020221012110122201212 |
4 | 30033211323332312 |
5 | 203411001131032 |
6 | 10012303121422 |
7 | 643532310221 |
oct | 141745737666 |
9 | 36835418655 |
10 | 13146505142 |
11 | 563694a991 |
12 | 266a8a3272 |
13 | 1316848c34 |
14 | 8c9dc45b8 |
15 | 51e240bb2 |
hex | 30f97bfb6 |
13146505142 has 4 divisors (see below), whose sum is σ = 19719757716. Its totient is φ = 6573252570.
The previous prime is 13146505133. The next prime is 13146505153. The reversal of 13146505142 is 24150564131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 24150564131 = 10477 ⋅2305103.
It is a junction number, because it is equal to n+sod(n) for n = 13146505099 and 13146505108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3286626284 + ... + 3286626287.
It is an arithmetic number, because the mean of its divisors is an integer number (4929939429).
Almost surely, 213146505142 is an apocalyptic number.
13146505142 is a deficient number, since it is larger than the sum of its proper divisors (6573252574).
13146505142 is an equidigital number, since it uses as much as digits as its factorization.
13146505142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6573252573.
The product of its (nonzero) digits is 14400, while the sum is 32.
The spelling of 13146505142 in words is "thirteen billion, one hundred forty-six million, five hundred five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •