Base | Representation |
---|---|
bin | 1011110111010000101100… |
… | …0011110101100001111111 |
3 | 1201011222211212120202121122 |
4 | 2331310023003311201333 |
5 | 3202203103303424043 |
6 | 43424155331421155 |
7 | 2514253340042525 |
oct | 275641303654177 |
9 | 51158755522548 |
10 | 13044001233023 |
11 | 4179a25704392 |
12 | 15680217547bb |
13 | 7380759a1687 |
14 | 331493b88315 |
15 | 179487589368 |
hex | bdd0b0f587f |
13044001233023 has 8 divisors (see below), whose sum is σ = 13190715303840. Its totient is φ = 12897290545920.
The previous prime is 13044001233019. The next prime is 13044001233073. The reversal of 13044001233023 is 32033210044031.
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 13044001233023 - 22 = 13044001233019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13044001232983 and 13044001233001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13044001233073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7351511 + ... + 8951687.
It is an arithmetic number, because the mean of its divisors is an integer number (1648839412980).
Almost surely, 213044001233023 is an apocalyptic number.
13044001233023 is a deficient number, since it is larger than the sum of its proper divisors (146714070817).
13044001233023 is an equidigital number, since it uses as much as digits as its factorization.
13044001233023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1691857.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 13044001233023 its reverse (32033210044031), we get a palindrome (45077211277054).
The spelling of 13044001233023 in words is "thirteen trillion, forty-four billion, one million, two hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •