Base | Representation |
---|---|
bin | 11000011011001100… |
… | …01101001110001011 |
3 | 1020211212110111120102 |
4 | 30031212031032023 |
5 | 203323413140243 |
6 | 10005105320015 |
7 | 642644561603 |
oct | 141546151613 |
9 | 36755414512 |
10 | 13113021323 |
11 | 5619a60006 |
12 | 265b63600b |
13 | 130c92431c |
14 | 8c5789c03 |
15 | 51b3299b8 |
hex | 30d98d38b |
13113021323 has 16 divisors (see below), whose sum is σ = 13862436000. Its totient is φ = 12369646080.
The previous prime is 13113021301. The next prime is 13113021331. The reversal of 13113021323 is 32312031131.
13113021323 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 13113021323 - 210 = 13113020299 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13113021295 and 13113021304.
It is not an unprimeable number, because it can be changed into a prime (13113051323) 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, 9024065 + ... + 9025517.
It is an arithmetic number, because the mean of its divisors is an integer number (866402250).
Almost surely, 213113021323 is an apocalyptic number.
13113021323 is a deficient number, since it is larger than the sum of its proper divisors (749414677).
13113021323 is a wasteful number, since it uses less digits than its factorization.
13113021323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3182.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 13113021323 its reverse (32312031131), we get a palindrome (45425052454).
The spelling of 13113021323 in words is "thirteen billion, one hundred thirteen million, twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •