Base | Representation |
---|---|
bin | 11000110010110011… |
… | …10100010110011001 |
3 | 1021100200011221212022 |
4 | 30121121310112121 |
5 | 204230120202223 |
6 | 10040503024225 |
7 | 650601325430 |
oct | 143131642631 |
9 | 37320157768 |
10 | 13311100313 |
11 | 5710850755 |
12 | 26b5a3b075 |
13 | 1341988124 |
14 | 903bcc117 |
15 | 52d904ac8 |
hex | 319674599 |
13311100313 has 16 divisors (see below), whose sum is σ = 16252369920. Its totient is φ = 10647678096.
The previous prime is 13311100277. The next prime is 13311100333. The reversal of 13311100313 is 31300111331.
13311100313 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 13311100313 - 218 = 13310838169 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13311100291 and 13311100300.
It is not an unprimeable number, because it can be changed into a prime (13311100333) 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, 737981 + ... + 755802.
It is an arithmetic number, because the mean of its divisors is an integer number (1015773120).
Almost surely, 213311100313 is an apocalyptic number.
It is an amenable number.
13311100313 is a deficient number, since it is larger than the sum of its proper divisors (2941269607).
13311100313 is a wasteful number, since it uses less digits than its factorization.
13311100313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1493876.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 13311100313 its reverse (31300111331), we get a palindrome (44611211644).
The spelling of 13311100313 in words is "thirteen billion, three hundred eleven million, one hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •