Base | Representation |
---|---|
bin | 11000011110101100… |
… | …10111101001001101 |
3 | 1020220220210022122200 |
4 | 30033112113221031 |
5 | 203403430033031 |
6 | 10012035432113 |
7 | 643452522240 |
oct | 141726275115 |
9 | 36826708580 |
10 | 13142424141 |
11 | 5634612860 |
12 | 2669455639 |
13 | 1315a4a542 |
14 | 8c9641257 |
15 | 51dbd68e6 |
hex | 30f597a4d |
13142424141 has 48 divisors (see below), whose sum is σ = 25059984768. Its totient is φ = 6425625600.
The previous prime is 13142424137. The next prime is 13142424167. The reversal of 13142424141 is 14142424131.
13142424141 is a `hidden beast` number, since 1 + 3 + 1 + 4 + 242 + 414 + 1 = 666.
It is not a de Polignac number, because 13142424141 - 22 = 13142424137 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13142424041) 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 47 ways as a sum of consecutive naturals, for example, 546000 + ... + 569561.
It is an arithmetic number, because the mean of its divisors is an integer number (522083016).
Almost surely, 213142424141 is an apocalyptic number.
13142424141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13142424141 is a deficient number, since it is larger than the sum of its proper divisors (11917560627).
13142424141 is a wasteful number, since it uses less digits than its factorization.
13142424141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1115602 (or 1115599 counting only the distinct ones).
The product of its digits is 3072, while the sum is 27.
Adding to 13142424141 its reverse (14142424131), we get a palindrome (27284848272).
The spelling of 13142424141 in words is "thirteen billion, one hundred forty-two million, four hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •