Base | Representation |
---|---|
bin | 1100000010111101001011… |
… | …1100100011001000000001 |
3 | 1201220012110110211100022201 |
4 | 3000233102330203020001 |
5 | 3214001100323331231 |
6 | 44100344520033201 |
7 | 2534625355103164 |
oct | 300572274431001 |
9 | 51805413740281 |
10 | 13244923261441 |
11 | 424715a983143 |
12 | 159ab56002801 |
13 | 750cb602a9a1 |
14 | 33b0b44bbadb |
15 | 17e7e693c161 |
hex | c0bd2f23201 |
13244923261441 has 4 divisors (see below), whose sum is σ = 13526730139392. Its totient is φ = 12963116383492.
The previous prime is 13244923261421. The next prime is 13244923261447. The reversal of 13244923261441 is 14416232944231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13244923261441 - 29 = 13244923260929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13244923261391 and 13244923261400.
It is not an unprimeable number, because it can be changed into a prime (13244923261447) 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, 140903438905 + ... + 140903438998.
It is an arithmetic number, because the mean of its divisors is an integer number (3381682534848).
Almost surely, 213244923261441 is an apocalyptic number.
It is an amenable number.
13244923261441 is a deficient number, since it is larger than the sum of its proper divisors (281806877951).
13244923261441 is an equidigital number, since it uses as much as digits as its factorization.
13244923261441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 281806877950.
The product of its digits is 995328, while the sum is 46.
The spelling of 13244923261441 in words is "thirteen trillion, two hundred forty-four billion, nine hundred twenty-three million, two hundred sixty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •