Base | Representation |
---|---|
bin | 1011110111010000101100… |
… | …0000010111011000100111 |
3 | 1201011222211210212112110012 |
4 | 2331310023000113120213 |
5 | 3202203103040314421 |
6 | 43424155300120435 |
7 | 2514253326232652 |
oct | 275641300273047 |
9 | 51158753775405 |
10 | 13044000323111 |
11 | 4179a2514279a |
12 | 156802139611b |
13 | 738075743474 |
14 | 3314939cc899 |
15 | 17948745995b |
hex | bdd0b017627 |
13044000323111 has 4 divisors (see below), whose sum is σ = 13045718681424. Its totient is φ = 13042281964800.
The previous prime is 13044000323093. The next prime is 13044000323141. The reversal of 13044000323111 is 11132300044031.
13044000323111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13044000323111 - 218 = 13044000060967 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 (13044000323141) 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, 859167770 + ... + 859182951.
It is an arithmetic number, because the mean of its divisors is an integer number (3261429670356).
Almost surely, 213044000323111 is an apocalyptic number.
13044000323111 is a deficient number, since it is larger than the sum of its proper divisors (1718358313).
13044000323111 is an equidigital number, since it uses as much as digits as its factorization.
13044000323111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1718358312.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13044000323111 its reverse (11132300044031), we get a palindrome (24176300367142).
The spelling of 13044000323111 in words is "thirteen trillion, forty-four billion, three hundred twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •