Base | Representation |
---|---|
bin | 11000010001011011… |
… | …01111110100111111 |
3 | 1020122011100002002202 |
4 | 30020231233310333 |
5 | 203141431040444 |
6 | 5553021542115 |
7 | 640631424113 |
oct | 141055576477 |
9 | 36564302082 |
10 | 13031111999 |
11 | 55877a5354 |
12 | 263811493b |
13 | 12c8975b79 |
14 | 8b8947743 |
15 | 51404a34e |
hex | 308b6fd3f |
13031111999 has 4 divisors (see below), whose sum is σ = 13031340840. Its totient is φ = 13030883160.
The previous prime is 13031111921. The next prime is 13031112049. The reversal of 13031111999 is 99911113031.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 99911113031 = 223 ⋅448031897.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13031111999 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13031113999) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45512 + ... + 167730.
It is an arithmetic number, because the mean of its divisors is an integer number (3257835210).
Almost surely, 213031111999 is an apocalyptic number.
13031111999 is a deficient number, since it is larger than the sum of its proper divisors (228841).
13031111999 is a wasteful number, since it uses less digits than its factorization.
13031111999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228840.
The product of its (nonzero) digits is 6561, while the sum is 38.
The spelling of 13031111999 in words is "thirteen billion, thirty-one million, one hundred eleven thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •