Base | Representation |
---|---|
bin | 11000110100001111… |
… | …01000011011110001 |
3 | 1021101111210010020022 |
4 | 30122013220123301 |
5 | 204241204011004 |
6 | 10042012253225 |
7 | 651105365450 |
oct | 143207503361 |
9 | 37344703208 |
10 | 13323110129 |
11 | 571760391a |
12 | 26b9a71215 |
13 | 1344301724 |
14 | 905636b97 |
15 | 52e9c82be |
hex | 31a1e86f1 |
13323110129 has 8 divisors (see below), whose sum is σ = 15241362240. Its totient is φ = 11408595696.
The previous prime is 13323110113. The next prime is 13323110131. The reversal of 13323110129 is 92101132331.
13323110129 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13323110129 - 24 = 13323110113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13323110098 and 13323110107.
It is not an unprimeable number, because it can be changed into a prime (13323110149) 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 7 ways as a sum of consecutive naturals, for example, 926774 + ... + 941039.
It is an arithmetic number, because the mean of its divisors is an integer number (1905170280).
Almost surely, 213323110129 is an apocalyptic number.
It is an amenable number.
13323110129 is a deficient number, since it is larger than the sum of its proper divisors (1918252111).
13323110129 is a wasteful number, since it uses less digits than its factorization.
13323110129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1868839.
The product of its (nonzero) digits is 972, while the sum is 26.
The spelling of 13323110129 in words is "thirteen billion, three hundred twenty-three million, one hundred ten thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •