Base | Representation |
---|---|
bin | 11000101010101000… |
… | …10010010111011101 |
3 | 1021011220011210220020 |
4 | 30111110102113131 |
5 | 204110042312113 |
6 | 10030013342353 |
7 | 646106513544 |
oct | 142524222735 |
9 | 37156153806 |
10 | 13242541533 |
11 | 5686084501 |
12 | 2696a979b9 |
13 | 13307025c0 |
14 | 8d8a6315b |
15 | 5278b1023 |
hex | 3155125dd |
13242541533 has 16 divisors (see below), whose sum is σ = 19045985280. Its totient is φ = 8135947584.
The previous prime is 13242541517. The next prime is 13242541603. The reversal of 13242541533 is 33514524231.
13242541533 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13242541533 - 24 = 13242541517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13242541494 and 13242541503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13242540533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 253053 + ... + 300866.
It is an arithmetic number, because the mean of its divisors is an integer number (1190374080).
Almost surely, 213242541533 is an apocalyptic number.
13242541533 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13242541533 is a deficient number, since it is larger than the sum of its proper divisors (5803443747).
13242541533 is a wasteful number, since it uses less digits than its factorization.
13242541533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 554548.
The product of its digits is 43200, while the sum is 33.
The spelling of 13242541533 in words is "thirteen billion, two hundred forty-two million, five hundred forty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •