Base | Representation |
---|---|
bin | 11000011010111101… |
… | …00111011000011011 |
3 | 1020211201201101210201 |
4 | 30031132213120123 |
5 | 203322411000243 |
6 | 10004554523031 |
7 | 642621633055 |
oct | 141536473033 |
9 | 36751641721 |
10 | 13111031323 |
11 | 5618920985 |
12 | 265aa36477 |
13 | 130c3a8600 |
14 | 8c53cc8d5 |
15 | 51b08504d |
hex | 30d7a761b |
13111031323 has 12 divisors (see below), whose sum is σ = 14397125328. Its totient is φ = 11932021920.
The previous prime is 13111031293. The next prime is 13111031347. The reversal of 13111031323 is 32313011131.
It is a de Polignac number, because none of the positive numbers 2k-13111031323 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 13111031323.
It is not an unprimeable number, because it can be changed into a prime (13111032323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 534340 + ... + 558337.
It is an arithmetic number, because the mean of its divisors is an integer number (1199760444).
Almost surely, 213111031323 is an apocalyptic number.
13111031323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13111031323 is a deficient number, since it is larger than the sum of its proper divisors (1286094005).
13111031323 is a wasteful number, since it uses less digits than its factorization.
13111031323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1092774 (or 1092761 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 13111031323 its reverse (32313011131), we get a palindrome (45424042454).
The spelling of 13111031323 in words is "thirteen billion, one hundred eleven million, thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •