Base | Representation |
---|---|
bin | 11000111001011100… |
… | …00001111100100011 |
3 | 1021111112212021011202 |
4 | 30130232001330203 |
5 | 204333340334111 |
6 | 10050211231415 |
7 | 652145222600 |
oct | 143456017443 |
9 | 37445767152 |
10 | 13366730531 |
11 | 573a197540 |
12 | 27105a856b |
13 | 135036510b |
14 | 90b34d6a7 |
15 | 533742b3b |
hex | 31cb81f23 |
13366730531 has 48 divisors (see below), whose sum is σ = 17829745920. Its totient is φ = 9889830720.
The previous prime is 13366730521. The next prime is 13366730537. The reversal of 13366730531 is 13503766331.
13366730531 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 13366730531 - 26 = 13366730467 is a prime.
It is a super-2 number, since 2×133667305312 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13366730537) 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 47 ways as a sum of consecutive naturals, for example, 1719305 + ... + 1727061.
It is an arithmetic number, because the mean of its divisors is an integer number (371453040).
Almost surely, 213366730531 is an apocalyptic number.
13366730531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13366730531 is a deficient number, since it is larger than the sum of its proper divisors (4463015389).
13366730531 is a wasteful number, since it uses less digits than its factorization.
13366730531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7944 (or 7937 counting only the distinct ones).
The product of its (nonzero) digits is 102060, while the sum is 38.
The spelling of 13366730531 in words is "thirteen billion, three hundred sixty-six million, seven hundred thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •