Base | Representation |
---|---|
bin | 1011110111010000110001… |
… | …0111110011000111000011 |
3 | 1201011222220101222222220111 |
4 | 2331310030113303013003 |
5 | 3202203124422240303 |
6 | 43424201435252151 |
7 | 2514254025113251 |
oct | 275641427630703 |
9 | 51158811888814 |
10 | 13044023243203 |
11 | 4179a37077a17 |
12 | 1568028baa057 |
13 | 73807a409a54 |
14 | 331496a775d1 |
15 | 179489485b6d |
hex | bdd0c5f31c3 |
13044023243203 has 4 divisors (see below), whose sum is σ = 13143595939848. Its totient is φ = 12944450546560.
The previous prime is 13044023243177. The next prime is 13044023243213. The reversal of 13044023243203 is 30234232044031.
It is a happy number.
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 13044023243203 - 225 = 13043989688771 is a prime.
It is a super-2 number, since 2×130440232432032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13044023243213) 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, 49786348126 + ... + 49786348387.
It is an arithmetic number, because the mean of its divisors is an integer number (3285898984962).
Almost surely, 213044023243203 is an apocalyptic number.
13044023243203 is a deficient number, since it is larger than the sum of its proper divisors (99572696645).
13044023243203 is an equidigital number, since it uses as much as digits as its factorization.
13044023243203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99572696644.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 13044023243203 its reverse (30234232044031), we get a palindrome (43278255287234).
The spelling of 13044023243203 in words is "thirteen trillion, forty-four billion, twenty-three million, two hundred forty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •