Base | Representation |
---|---|
bin | 1100000001000011110111… |
… | …0000111111110010001001 |
3 | 1201210002101210010121120221 |
4 | 3000100331300333302021 |
5 | 3212432401022004331 |
6 | 44033401123150041 |
7 | 2532363330036505 |
oct | 300207560776211 |
9 | 51702353117527 |
10 | 13212355656841 |
11 | 4234368360840 |
12 | 1594787215321 |
13 | 74abc5a26033 |
14 | 3396a5065305 |
15 | 17da3c6d1711 |
hex | c043dc3fc89 |
13212355656841 has 4 divisors (see below), whose sum is σ = 14413478898384. Its totient is φ = 12011232415300.
The previous prime is 13212355656823. The next prime is 13212355656893. The reversal of 13212355656841 is 14865655321231.
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 13212355656841 - 233 = 13203765722249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13212355656821) 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, 600561620755 + ... + 600561620776.
It is an arithmetic number, because the mean of its divisors is an integer number (3603369724596).
Almost surely, 213212355656841 is an apocalyptic number.
13212355656841 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13212355656841 is a deficient number, since it is larger than the sum of its proper divisors (1201123241543).
13212355656841 is a wasteful number, since it uses less digits than its factorization.
13212355656841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1201123241542.
The product of its digits is 5184000, while the sum is 52.
The spelling of 13212355656841 in words is "thirteen trillion, two hundred twelve billion, three hundred fifty-five million, six hundred fifty-six thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •