Base | Representation |
---|---|
bin | 11000011011001100… |
… | …01000110100101111 |
3 | 1020211212102120212022 |
4 | 30031212020310233 |
5 | 203323412101221 |
6 | 10005105100355 |
7 | 642644455232 |
oct | 141546106457 |
9 | 36755376768 |
10 | 13113003311 |
11 | 5619a48521 |
12 | 265b6276bb |
13 | 130c919075 |
14 | 8c5783419 |
15 | 51b3244ab |
hex | 30d988d2f |
13113003311 has 16 divisors (see below), whose sum is σ = 13953408000. Its totient is φ = 12288358368.
The previous prime is 13113003307. The next prime is 13113003353. The reversal of 13113003311 is 11330031131.
13113003311 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 13113003311 - 22 = 13113003307 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13113003311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13113000311) 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, 644090 + ... + 664136.
It is an arithmetic number, because the mean of its divisors is an integer number (872088000).
Almost surely, 213113003311 is an apocalyptic number.
13113003311 is a deficient number, since it is larger than the sum of its proper divisors (840404689).
13113003311 is a wasteful number, since it uses less digits than its factorization.
13113003311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20438.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 13113003311 its reverse (11330031131), we get a palindrome (24443034442).
The spelling of 13113003311 in words is "thirteen billion, one hundred thirteen million, three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •