Base | Representation |
---|---|
bin | 11001001101000010… |
… | …01101111101100001 |
3 | 1021221000020100002201 |
4 | 30212201031331201 |
5 | 210202433102113 |
6 | 10114403213201 |
7 | 656212553341 |
oct | 144641157541 |
9 | 37830210081 |
10 | 13531144033 |
11 | 5813a83870 |
12 | 2757677201 |
13 | 137843c704 |
14 | 92510ad21 |
15 | 542dbccdd |
hex | 32684df61 |
13531144033 has 16 divisors (see below), whose sum is σ = 15670877760. Its totient is φ = 11546841600.
The previous prime is 13531144019. The next prime is 13531144043. The reversal of 13531144033 is 33044113531.
13531144033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13531144033 - 213 = 13531135841 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13531143992 and 13531144010.
It is not an unprimeable number, because it can be changed into a prime (13531144043) 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, 24588 + ... + 166333.
It is an arithmetic number, because the mean of its divisors is an integer number (979429860).
Almost surely, 213531144033 is an apocalyptic number.
It is an amenable number.
13531144033 is a deficient number, since it is larger than the sum of its proper divisors (2139733727).
13531144033 is a wasteful number, since it uses less digits than its factorization.
13531144033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191328.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 13531144033 its reverse (33044113531), we get a palindrome (46575257564).
The spelling of 13531144033 in words is "thirteen billion, five hundred thirty-one million, one hundred forty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •