Base | Representation |
---|---|
bin | 1100000011011110011010… |
… | …1110000000110100111001 |
3 | 1201221001111020112001120222 |
4 | 3000313212232000310321 |
5 | 3214122333300223344 |
6 | 44104422102225425 |
7 | 2535362430040226 |
oct | 300674656006471 |
9 | 51831436461528 |
10 | 13253844929849 |
11 | 424aa18a32717 |
12 | 15a0825a25275 |
13 | 751aa84b3114 |
14 | 33b6bd34294d |
15 | 17eb69ce45ee |
hex | c0de6b80d39 |
13253844929849 has 4 divisors (see below), whose sum is σ = 13275326040564. Its totient is φ = 13232363819136.
The previous prime is 13253844929813. The next prime is 13253844929917. The reversal of 13253844929849 is 94892944835231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1345182432400 + 11908662497449 = 1159820^2 + 3450893^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13253844929849 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13253844929449) 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, 10740554432 + ... + 10740555665.
It is an arithmetic number, because the mean of its divisors is an integer number (3318831510141).
Almost surely, 213253844929849 is an apocalyptic number.
It is an amenable number.
13253844929849 is a deficient number, since it is larger than the sum of its proper divisors (21481110715).
13253844929849 is an equidigital number, since it uses as much as digits as its factorization.
13253844929849 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21481110714.
The product of its digits is 537477120, while the sum is 71.
The spelling of 13253844929849 in words is "thirteen trillion, two hundred fifty-three billion, eight hundred forty-four million, nine hundred twenty-nine thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •